On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximation Algorithms for Unique Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
How to Play Unique Games Using Embeddings
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
Unique games on expanding constraint graphs are easy: extended abstract
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximation Resistant Predicates from Pairwise Independence
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
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.