How to Play Unique Games on Expanders

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 < cG 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.

• Type: Journal
• Year: 2010
• Where: WAOA
• Authors: Konstantin Makarychev, Yury Makarychev
• Keywords: Algorithms, Smallest Eigenvalue, Unique Games, UNIQUE GAMES Problem, WAOA 2010