How to Play Unique Games on Expanders
- Cite this paper as:
- Makarychev K., Makarychev Y. (2011) How to Play Unique Games on Expanders. In: Jansen K., Solis-Oba R. (eds) Approximation and Online Algorithms. WAOA 2010. Lecture Notes in Computer Science, vol 6534. Springer, Berlin, Heidelberg
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1 − ε)-satisfiable instance of Unique Games with the constraint graph G, our algorithm finds an assignment satisfying at least a 1 − Cε/hG fraction of all constraints if ε < cλG where hG is the edge expansion of G, λG is the second smallest eigenvalue of the Laplacian of G, and C and c are some absolute constants.
Unable to display preview. Download preview PDF.