Approximating unique games

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 99-106

  Gupta, Anupam ^a   Talwar, Kunal ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING;

MAX-CUT; UNIQUE GAMES; VERTEX-COVER;

GAME THEORY;

EID: 33244466257     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109569     Document Type: Conference Paper

References (13)

1. A. AGARWAL, M. CHARIKAR, K. MAKARYCHEV, AND Y. MAKARYCHEV, o(√logn) approximation algorithms for min uncut, min 2cnf deletion, and directed cut problems, in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, New York, NY, USA, 2005, ACM Press, pp. 573-581.
2. N. ALON AND J. SPENCER, The Probabilistic Method, Wiley Interscience, New York, 1992.
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 Annual Conference on Computational Complexity, 2005.
4. J. FAKCHAROENPHOL, S. RAO, AND K. TALWAR, A tight bound on approximating arbitrary metrics by tree metrics, in Proceedings of the thirty-fifth ACM symposium on Theory of computing, ACM Press, 2003, pp. 448-455.
5. U. FEIGE AND D. REICHMAN, On systems of linear equations with two variables per equation, in Proceedings of the 7th APPROX, vol. 3122 of Lecture Notes in Computer Science, 2004, pp. 117-127.
6. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115-1145.
7. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric algorithms and combinatorial optimization, Springer-Verlag, Berlin, 1988.
8. S. KHOT, On the power of unique 2-prover 1-round games, in 34th Annual ACM Symposium on the Theory of Computing, July 2002, pp. 767-775.
9. S. KHOT, G. KINDLER, E. MOSSEL, AND R. O'DONNELL, Optimal inapproximability results for max-cut and other 2-variable csps?, in Proceedings of the 45th Symposium on the Foundations of Computer Science (FOCS), 2004, pp. 146-154.
10. S. KHOT AND O. REGEV, Vertex cover might be hard to approximate to within 2 - ε, in Proceedings of the 18th IEEE Annual Conference on Computational Complexity, 2003, pp. 379-.
11. 1, in Proceedings of the 46th Symposium on the Foundations of Computer Science (FOCS), 2005, p. to appear.
12. L. TREVISAN, Approximation algorithms for unique games, Tech. Report TR05-034, ECCC, April 2005. See also the attached comment, May 13, 2005.
13. V. V. VAZIRANI, Approximation algorithms, Springer-Verlag, Berlin, 2001.