Near-optimal algorithms for unique games

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 205-214

  Charikar, Moses ^a   Makarychev, Konstantin ^a   Makarychev, Yury ^a  

^a Princeton University   (United States)

Author keywords

Approximation Algorithms; Constraint Satisfaction Problems; Semidefinite Programming; Unique Games

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; CONSTRAINT SATISFACTION PROBLEMS; SEMIDEFINITE PROGRAMMING; UNIQUE GAMES;

GAME THEORY;

EID: 33748118086     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132547     Document Type: Conference Paper

References (17)

1. A. Agarwal, M. Charikar, K. Makarychev, and Y. Makarychev. O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 573-581, 2005.
2. G. Andersson, L. Engebretsen, and J. Håstad. A new way to use semidefinite programming with applications to linear equations mod p. Journal of Algorithms, Vol. 39, pp. 162-204, 2001.
3. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. In Proceedings of the 20th IEEE Conference on Computational Complexity, pp. 144-153, 2005.
4. E. Chlamtac, K. Makarychev and Y. Makarychev. How to play any Unique Game, manuscript, February 2006.
5. I. Dinur, E. Mossel, and O. Regev. Conditional hardness for approximate coloring. ECCC Technical Report TR05-039, 2005.
6. U. Feige and L. Lovasz, Two-prover one round proof systems; Their power and their problems. In Proceedings of the 24th ACM Symposium on Theory of Computing, pp. 733-741, 1992.
7. U. Feige and D. Reichman. On systems of linear equations with two variables per equation. In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization, vol. 3122 of Lecture Notes in Computer Science, pp. 117-127, 2004.
8. M. Goemans, D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, vol. 42, no. 6, pp. 1115-1145, Nov. 1995.
9. A. Gupta and K. Talwar. Approximating Unique Games. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 99-106, 2006.
10. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 767-775, 2002.
11. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other two-variable CSPs? In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 146-154, 2004.
12. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? ECCC Report TR05-101, 2005.
13. S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2 - ε. In Proceedings of the 18th IEEE Conference on Computational Complexity, pp. 379-386, 2003.
14. 1. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pp. 53-62, 2005.
15. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pp. 21-40, 2005.
16. Z. Šidák. Rectangular Confidence Regions for the Means of Multivariate Normal Distributions. Journal of the American Statistical Association, vol. 62, no. 318, pp. 626-633, Jun. 1967.
17. L. Trevisan. Approximation Algorithms for Unique Games. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pp. 197-205, 2005.