Sherali-adams relaxations of the matching polytope

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 293-302

  Mathieu, Claire ^a   Sinclair, Alistair ^b  

^a Brown Univerity   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

0 1 programming; Integrality gap; Lift and project; Linear programming relaxation; Matching polytope; Maximum matching

Indexed keywords

0-1 PROGRAMMING; INTEGRALITY GAP; LIFT-AND-PROJECT; LINEAR PROGRAMMING RELAXATION; MATCHING POLYTOPE; MAXIMUM MATCHING;

DYNAMIC PROGRAMMING; GRAPH THEORY; IMAGE RETRIEVAL; LINEAR PROGRAMMING; LINEARIZATION; OPTIMIZATION; PHASE TRANSITIONS;

COMPUTATION THEORY;

EID: 70350672582     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536456     Document Type: Conference Paper

References (28)

1. N.E. AGUILERA, S.M. BIANCHI and G.L. NASINI. Lift and project relaxations for the matching and related polytopes. Disc. Appl. Math. 134 (2004), pp. 193-212.
2. M. ALEKHNOVICH, S. ARORA and I. TOURLAKIS. Towards strong non-approximability results in the Lovász-Schrijver hierarchy. Proc. 37th ACM STOC, 2005, pp. 294-303.
3. S. ARORA, B. BOLLOBÁS and L. LOVÁSZ. Proving integrality gaps without knowing the linear program. Proc. 43rd ACM STOC, 2002, pp. 313-322.
4. S. ARORA, B.BOLLOBÁS, L.LOVÁSZ and I.TOURLAKIS. Proving integrality gaps without knowing the linear program. Theory of Computing 2 (2006), pp. 19-51.
5. E. BALAS, S. CERIA and G. CORNUÉJOLS. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming 58 (1993), pp. 295-324.
6. C. BERGE. Sur le couplage maximum d'un graphe. C.R. Acad. Sci. Paris Sér. I Math. 247 (1958), pp. 258-259
7. J.A. BONDY and U.S.R. MURTY. Graph Theory: An Advanced Course, Springer, 2007.
8. J. BURESH-OPPENHEIM, N. GAlesi, S. HOORY, A. MAGEN and T. PITASSI. Rank bounds and integrality gaps for cutting plane procedures. Proc. 44th IEEE FOCS, 2003, pp. 318-327.
9. M. CHARIKAR. On semidefinite programming relaxations for graph coloring and vertex cover. Proc. 13th ACM-SIAM SODA, 2002, pp. 616-620.
10. M.CHARIKAR, K.MAKARYCHEV and Y.MAKARYCHEV. Integrality gaps for Sherali-Adams relaxations. Proc. 41st ACM STOC, 2009. (This volume.)
11. E. Chlamtac. Approximation algorithms using hierarchies of semidefinite programming relaxations. Proc. 48th IEEE FOCS, 2007, pp. 691-701.
12. U. FEIGE and R. KRAUTHGAMER. The probable value of the Lovász-Schrijver relaxations for maximum independent set. SIAM J. Computing 32 (2003), pp. 345-370.
13. W.FERNANDEZ DE LA VEGA and C.KENYON- MATHIEU. Linear programming relaxations ofMaxcut. Proc. 18th ACM-SIAM SODA, 2007, pp. 53-61.
14. K.GEORGIOU, A.MAGEN, T.PITASSI and I.TOURLAKIS. Integrality gaps of 2-o(1) for vertex cover SDPs in the Lovász-Schrijver hierarchy. Proc. 48th IEEE FOCS, 2007, pp. 702-712.
15. M.X. GOEMANS and L. TUNÇEL. When does the positive semidefiniteness constraint help in lifting procedures? Math. Oper. Res. 26 (2001), pp. 796-815.
16. D. GRIGORIEV, E. HIRSCH and D. PASECHNIK. Complexity of semialgebraic proofs. Moscow Mathematical Journal 2 (2002), pp. 647-679.
17. S.-P. HONG and L. TUNÇEL. Unification of lowerbound analyses of the lift-and-project rank of combinatorial optimization polyhedra. Disc. Appl. Math. 156 (2008), pp. 25-41.
18. A. KOJEVNIKOV and D. ITSYKSON. Lower bounds for static Lovász-Schrijver calculus proofs for Tseitin tautologies. Proc. ICALP 2006, pp. 323-334.
19. J.B. LASSERRE. Global optimization with polynomials and the problem of moments. SIAM J. Optimization 11 (2001), pp. 796-817.
20. J.B. LASSERRE. An explicit exact SDP relaxation for nonlinear 0-1 programs. Proc. 8th IPCO, 2001, Springer Lecture Notes in Computer Science 2081, pp. 293-303.
21. M. LAURENT. A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming. Math. Oper. Res. 28 (2003), pp. 470-496.
22. L. LOVÁSZ and A. SCHRIJVER. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization 1 (1991), pp. 166-190.
23. T. PITASSI and N. SEGERLIND. Exponential lower bounds and integrality gaps for tree-like Lovász Schrijver procedures. Proc. 20th ACM-SIAM SODA, 2009, pp. 355-364.
24. G. SCHOENEBECK. Linear level Lasserre lower bounds for certain k-CSPs. Proc. 49th IEEE FOCS, 2008, pp. 593-602.
25. G. SCHOENEBECK, L. TREVISAN and M. TULSIANI. Tight integrality gaps for Lovász-Schrijver SDP relaxations of vertex cover and max cut. Proc. 39th ACM STOC, 2007, pp. 302-310.
26. H.D. SHERALI and W.P. ADAMS. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3 (1990), pp. 411-430.
27. T. STEPHEN and L. TUNÇEL. On a representation of the matching polytope via semidefinite liftings. Math. Oper. Res. 24 (1999), pp. 1-7.
28. I. TOURLAKIS. New lower bounds for vertex cover in the Lovász-Schrijver hierarchy. Proc. 21st IEEE Conference on Computational Complexity, 2006, pp. 170-182.