Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the Hardness of Approximating Multicut and Sparsest-Cut
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Conditional hardness for approximate coloring
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Information Processing Letters
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Approximating maximum satisfiable subsystems of linear equations of bounded width
Information Processing Letters
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unique games on expanding constraint graphs are easy: extended abstract
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomly supported independence and resistance
Proceedings of the forty-first annual ACM symposium on Theory of computing
ACM Transactions on Computation Theory (TOCT)
Approximate Lasserre integrality gap for unique games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
How to play unique games on expanders
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Spectral Sparsification of Graphs
SIAM Journal on Computing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Parallel Repetition in Projection Games and a Concentration Bound
SIAM Journal on Computing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 - O(1/ log n), satisfies a constant fraction of constraints, where n is the number of variables. For suficiently large alphabets, it improves an algorithm of Khot (STOC驴02) that satisfies a constant fraction of constraints in unique games of value 1 - O(1/(k^{10} (\log k)^5 )), where k is the size of the alphabet. We also present a simpler algorithm for the special case of unique games with linear constraints.Finally, we present a simple approximation algorithm for 2-to-1 games.