The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l 1

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

Volumn 2005, Issue , 2005, Pages 53-62

  Khot, Subhash A ^a   Vishnoi, Nisheeth K ^b  

^a Georgia Institute of Technology   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT DISTORTION; INTEGRALITY GAP; NEGATIVE TYPE METRICS; UNIQUE GAMES CONJECTURE(UGC);

COMPUTER SIMULATION; CONSTRAINT THEORY; EMBEDDED SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

GAME THEORY;

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

References (29)

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 ACM Symposium on the Theory of Computing, number 37, pages 573-581, 2005.
2. S. Arora, E. Berger, E. Hazan, G. Kindler, and S. Safra. On non-approximability for quadratic programs. In Annual Symposium on Foundations of Computer Science, number 46, 2005. To appear.
3. S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the sparsest cut. In Proceedings of the ACM Symposium on the Theory of Computing, number 37, pages 553-562, 2005.
4. S. Arora, L. Lovász, I. Newman, Y. Rabani, Y. Rabinovich, and S. Vempala. Local versus global properties of metric spaces. Manuscript, 2005.
5. S. Arora, S. Rao, and U. V. Vazirani. Expander fbws, geometric embeddings and graph partitioning. In Proceedings of the ACM Symposium on the Theory of Computing, number 36, pages 222-231, 2004.
6. Y. Aumann and Y. Rabani. An O(log k) approximate mincut max-fbw theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301, 1998.
7. J. Bourgain. On lipschitz embeddings of finite metric spaces in hilbert space. Israel Journal of Mathematics, 52:46-52, 1985.
8. J. Bourgain. On the distribution of the fourier spectrum of boolean functions. Israel Journal of Mathematics, 131:269-276, 2002.
9. S. Chawla, A. Gupta, and H. Räcke. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 102-111, 2005.
10. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. In Proceedings of the Annual IEEE Conference on Computational Complexity, number 20, pages 144-153, 2005.
11. M. Deza and M. Laurent. Geometry of cuts and metrics. Springer-Verlag, New York, 1997.
12. p spaces. Arkiv. Mat., 8:103-105, 1969.
13. U. Feige, M. T. Hajiaghayi, and J. R. Lee. Improved approximation algorithms for minimum-weight vertex separators. In Proceedings of the ACM Symposium on the Theory of Computing, number 37, pages 563-572, 2005.
14. U. Feige and L. Lovász. Two-prover one-round proof systems, their power and their problems. In Proceedings of the ACM Symposium on the Theory of Computing, number 24, pages 733-744, 2002.
15. U. Feige and G. Schechtman. On the optimality of the random hyperplane rounding technique for max cut. Random Struct. Algorithms, 20(3):403-440, 2002.
16. M. X. Goemans. Semidefi nite programming in combinatorial optimization. Math. Program., 79:143-161, 1997.
17. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145, 1995.
18. G. Karakostas. A better approximation ratio for the vertex cover problem. ECCC Report TR04-084, 2004.
19. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the ACM Symposium on the Theory of Computing, number 34, pages 767-775, 2002.
20. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for max-cut and other 2-variable CSPs? In Annual Symposium on Foundations of Computer Science, number 45, pages 146-154, 2004.
21. S. Khot and A. Naor. Nonembeddability theorems via fourier analysis. In Annual Symposium on Foundations of Computer Science, number 46, 2005. To appear.
22. S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2 - ε. In Proceedings of the Annual IEEE Conference on Computational Complexity, number 18, pages 379-386, 2003.
23. F. T. Leighton and S. Rao. Multicommodity max-fbw mincut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999.
24. N. Linial. Finite metric spaces: combinatorics, geometry and algorithms. In Proceedings of the International Congress of Mathematicians, number III, pages 573-586, 2002.
25. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
26. J. Matousek. Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.
27. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low infuences: invariance and optimality. In Annual Symposium on Foundations of Computer Science, number 46, 2005. To appear.
28. A. Naor, Y. Rabani, and A. Sinclair. Quasisymmetric embeddings, the observable diameter and expansion properties of graphs. Manuscript, 2005.
29. G. Schechtman. Handbook of the Geometry of Banach Spaces, volume 2, Concentration results and applications. North Holland, 2003.