How to play unique games using embeddings

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 687-696

  Chlamtac, Eden ^a   Makarychev, Konstantin ^a   Makarychev, Yury ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN SIZE; EMBEDDING TECHNIQUES; SEMIDEFINITE RELAXATIONS; UNIQUE GAMES;

CONSTRAINT THEORY; EMBEDDED SYSTEMS; RELAXATION PROCESSES;

GAME THEORY;

EID: 38749131224     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.36     Document Type: Conference Paper

References (12)

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. S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the sparsest cut. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 553-562, 2005.
3. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 222-231, 2004.
4. M. Charikar, K. Makarychev, and Y. Makarychev. Near-Optimal Algorithms for Unique Games. To appear in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006.
5. 1. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 102-111, 2005.
6. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 698-707, 1993.
7. M. Goemans and 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.
8. A. Gupta and K. Talwar. Approximating Unique Games. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 99-106, 2006.
9. 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.
10. 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.
11. J. R. Lee. On distance scales, embeddings, and efficient relaxations of the cut cone. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 92-101, 2005.
12. L. Trevisan. Approximation Algorithms for Unique Games. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pp. 197-205, 2005.