Sciweavers

Share
FOCS
2006
IEEE

How to Play Unique Games Using Embeddings

9 years 8 days ago
How to Play Unique Games Using Embeddings
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is satisfiable, the algorithm finds an assignment satisfying a 1 − O(ε log n log k) fraction of all constraints. To this end, we introduce new embedding techniques for rounding semidefinite relaxations of problems with large domain size.
Eden Chlamtac, Konstantin Makarychev, Yury Makaryc
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where FOCS
Authors Eden Chlamtac, Konstantin Makarychev, Yury Makarychev
Comments (0)
books