Approximation algorithms for unique games

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

Volumn 2005, Issue , 2005, Pages 197-205

  Trevisan, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR CONSTRAINTS; POLYNOMIAL TIME ALGORITHM;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER PROGRAMMING; COMPUTER SCIENCE; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION;

GAME THEORY;

EID: 33748605306     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.22     Document Type: Conference Paper

References (14)

1. [CKK+05] Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, and D.Sivakumar. On the hardness of approximating multicut and sparsest-cut, In Proceedings of the 20th IEEE Conference on Computational Complexity, 2005.
2. [CMM05] Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Personal Communication, 2005.
3. [DMR05] Irit Dinur, Elchanan Mossel, and Oded Regev. Conditional hardness for approximate coloring. cs.CC/0504062, 2005.
4. [FL92] Uri Feige and László Lovász. Two-prover one round proof systems: Their power and their problems. In Proceedings of the 24th ACM Symposium on Theory of Computing, pages 733-741, 1992.
5. [FR04] Uriel Feige and Daniel Reichman. On systems of linear equations with two variables per equation. In Proc. of APPROX-RANDOM'04, pages 117-127, 2004.
6. [Kho02] Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 767-775, 2002.
7. [KKMO04] Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan 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, pages 146-154, 2004.
8. [KR03] Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2 - ε. In Proceedings of the 18th IEEE Conference on Computational Complexity, 2003.
9. 1. Manuscript, 2005.
10. [LR99] Frank T. Leighton and Satish Rao. Multi-commodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46:787-832, 1999.
11. [MOO05] Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. math.PR/0503503, 2005.
12. [Oba04] Kenji Obata. Approximate max-integralflow/min-multicut theorems. In Proceedings of the 36th ACM Symposium on Theory of Computing, pages 539-545, 2004.
13. [Raz98] Ran Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998. Preliminary version in Proc. of STOC'95.
14. [Tre05] Luca Trevisan. Approximation algorithms for unique games. Technical Report TR05-34, Electronic Colloquium on Computational Complexity, 2005.