Integrality gaps of 2 - o(1) for vertex cover SDPs in the Lov́asz-Schrijver hierarchy

SIAM Journal on Computing

Volumn 39, Issue 8, 2010, Pages 3553-3570

  Georgiou, Konstantinos ^a   Magen, Avner ^a   Pitassi, Toniann ^a   Tourlakis, Iannis ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Integrality gap; Lov asz Schrijver semidefinite programming hierarchy; Vertex cover

Indexed keywords

APPROXIMATION FACTOR; GREEDY ALGORITHMS; INTEGRALITY GAPS; LARGE CLASS; LINEAR AND SEMIDEFINITE PROGRAMMING; LP RELAXATION; MAX CUT; NEW YORK; NP-HARD; NP-HARD PROBLEM; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; PROBABILISTICALLY CHECKABLE PROOF; SDP RELAXATION; SEMI-DEFINITE PROGRAMMING; SPARSEST CUT; VERTEX COVER;

COMPUTATIONAL COMPLEXITY; MATHEMATICAL PROGRAMMING;

APPROXIMATION ALGORITHMS;

EID: 78751480853     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080721479     Document Type: Article

References (29)

1. M. ALEKHNOVICH, S. ARORA, AND I. TOURLAKIS, Towards strong nonapproximability results in the Lovász-Schrijver hierarchy, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, H. N. Gabow and R. Fagin, eds., ACM Press, New York, 2005, pp. 294-303. (Pubitemid 43098599)
2. N. ALON AND N. KAHALE, Approximating the independence number via the theta-function, Math. Program., 80 (1998), pp. 253-264.
3. S. ARORA, B. BOLLOBÁS, L. LOVÁSZ, AND I. TOURLAKIS, Proving integrality gaps without knowing the linear program, Theory Comput., 2 (2006), pp. 19-51.
4. S. ARORA, S. RAO, AND U. VAZIRANI, Expander flows, geometric embeddings and graph partitioning, J. ACM, 56 (2009), pp. 1-37.
5. J. BURESH-OPPENHEIM, N. GALESI, S. HOORY, A. MAGEN, AND T. PITASSI, Rank bounds and integrality gaps for cutting planes procedures, Theory Comput., 2 (2006), pp. 65-90.
6. M. CHARIKAR, On semidefinite programming relaxations for graph coloring and vertex cover, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, 2002, pp. 616-620.
7. M. CHARIKAR, K. MAKARYCHEV, AND Y. MAKARYCHEV, Integrality gaps for Sherali-Adams relaxations, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, New York, 2009, pp. 283-292.
8. I. DINUR AND S. SAFRA, On the hardness of approximating minimum vertex cover, Ann. Of Math. (2), 162 (2005), pp. 439-486.
9. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY, Interactive proofs and the hardness of approximating cliques, J. ACM, 43 (1996), pp. 268-292.
10. P. FRANKL AND V. RÖDL, Forbidden intersections, Trans. Amer. Math. Soc., 300 (1987), pp. 259-286.
11. K. GEORGIOU, A. MAGEN, AND I. TOURLAKIS, Vertex cover resists SDPs tightened by local hypermetric inequalities, in Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 5035, A. Lodi, A. Panconesi, and G. Rinaldi, eds., Springer, Berlin, 2008, pp. 140-153.
12. K. GEORGIOU, A. MAGEN, AND I. TOURLAKIS, On the tightening of the standard SDP for vertex cover with ℓ1 inequalities, in Proceedings of the 29th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, R. Kannan and K. N. Kumar, eds., Leibniz International Proceedings in Informatics (LIPIcs) 4, Dagstuhl, Germany, 2009, pp. 203-214.
13. M. X. GOEMANS AND J. KLEINBERG, The Lovász theta function and a semidefinite programming relaxation of vertex cover, SIAM J. Discrete Math., 11 (1998), pp. 196-204.
14. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
15. E. HALPERIN, Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs, SIAM J. Comput., 31 (2002), pp. 1608-1623.
16. H. HATAMI, A. MAGEN, AND E. MARKAKIS, Integrality gaps of semidefinite programs for vertex cover and relations to ℓ1 embeddability of negative type metrics, in Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization, Algorithms and Techniques, Lecture Notes in Comput. Sci. 4627, M. Charikar, K. Jansen, O. Reingold, and J. D. P. Rolim, eds., Springer, Berlin, 2007, pp. 164-179.
17. J. KAHN AND G. KALAI, A counterexample to Borsuk's conjecture, Bull. Amer. Math. Soc. (N.S.), 29 (1993), pp. 60-62.
18. G. KARAKOSTAS, A better approximation ratio for the vertex cover problem, ACM Trans. Algorithms, 5 (2009), pp. 1-8.
19. S. KHOT, On the power of unique 2-prover 1-round games, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, New York, 2002, pp. 767-775. (Pubitemid 35009440)
20. S. KHOT AND O. REGEV, Vertex cover might be hard to approximate to within 2-ε, J. Comput. System Sci., 74 (2008), pp. 335-349.
21. J. B. LASSERRE, An explicit exact SDP relaxation for nonlinear 0-1 programs, in Proceedings of the 8th International Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 2081, Springer, Berlin, 2001, pp. 293-303.
22. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
23. L. LOVÁSZ, Semidefinite programs and combinatorial optimization, in Recent Advances in Algorithms and Combinatorics, B. A. Reed and C. L. Sales, eds., CMS Books Math. Ouvrages Math. SMC 11, Springer, Berlin, 2003, pp. 137-194.
24. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
25. G. SCHOENEBECK, Linear level Lasserre lower bounds for certain k-CSPs, in Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, 2008, pp. 593-602.
26. G. SCHOENEBECK, L. TREVISAN, AND M. TULSIANI, A linear round lower bound for Lovász-Schrijver SDP relaxations of vertex cover, in Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, 2007, pp. 205-216.
27. G. SCHOENEBECK, L. TREVISAN, AND M. TULSIANI, Tight integrality gaps for Lovász-Schrijver LP relaxations of vertex cover and Max Cut, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, David S. Johnson and Uriel Feige, eds., ACM Press, New York, 2007, pp. 302-310.
28. I. TOURLAKIS, New lower bounds for vertex cover in the Lovász-Schrijver hierarchy, in Proceedings of the 21st IEEE Conference on Computational Complexity, 2006, pp. 170-182.
29. M. TULSIANI, CSP gaps and reductions in the Lasserre hierarchy, in Proceedings of the 41th Annual ACM Symposium on Theory of Computing, New York, 2009, pp. 303-312.