Linear vs. semidefinite extended formulations: Exponential separation and strong lower bounds

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 95-106

  Fiorini, Samuel ^a   Massar, Serge ^a   Pokutta, Sebastian ^b   Tiwary, Hans Raj ^a   De Wolf, Ronald ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

combinatorial optimization; communication complexity; linear programming; quantum communication complexity; semidefinite programming

Indexed keywords

COMMUNICATION COMPLEXITY; EXTENDED FORMULATIONS; LINEAR PROGRAMS; LOWER BOUNDS; POLYTOPES; QUANTUM COMMUNICATION COMPLEXITY; SEMI-DEFINITE PROGRAMMING; STABLE SET POLYTOPE; TRAVELING SALESMAN;

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING; QUANTUM COMMUNICATION;

COMPUTATION THEORY;

EID: 84862620949     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2213988     Document Type: Conference Paper

References (49)

1. S. Aaronson. Lower bounds for local search by quantum arguments. In Proc. STOC 2004, pages 465-474, 2004.
2. D. Aharonov and O. Regev. Lattice problems in NP ∩ coNP. In Proc. FOCS 2004, pages 362-371, 2004.
3. S. Arora, B. Bollobás, and L. Lovász. Proving integrality gaps without knowing the linear program. In Proc. FOCS 2002, pages 313-322, 2002.
4. S. Arora, B. Bollobás, L. Lovász, and I. Tourlakis. Proving integrality gaps without knowing the linear program. Theory Comput., 2:19-51, 2006.
5. E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods, 6:466-486, 1985.
6. E. Balas, S. Ceria, and G. Cornuéjols. A lift-and-project algorithm for mixed 0-1 programs. Math. Programming, 58:295-324, 1993.
7. S. Benabbas and A. Magen. Extending SDP integrality gaps to Sherali-Adams with applications to quadratic programming and MaxCutGain. In Proc. IPCO 2010, pages 299-312, 2010.
8. H. Buhrman, R. Cleve, S. Massar, and R. de Wolf. Nonlocality and communication complexity. Rev. Modern Phys., 82:665, 2010.
9. J. Buresh-Oppenheim, N. Galesi, S. Hoory, A. Magen, and T. Pitassi. Rank bounds and integrality gaps for cutting planes procedures. Theory Comput., 2:65-90, 2006.
10. M. Charikar, K. Makarychev, and Y. Makarychev. Integrality gaps for Sherali-Adams relaxations. In Proc. STOC 2009, pages 283-292, 2009.
11. M. Conforti, G. Cornuéjols, and G. Zambelli. Extended formulations in combinatorial optimization. 4OR, 8:1-48, 2010.
12. C. De Simone. The cut polytope and the Boolean quadric polytope. Discrete Math., 79:71-75, 1989/90.
13. M.M. Deza and M. Laurent. Geometry of cuts and metrics, volume 15 of Algorithms and Combinatorics. Springer-Verlag, 1997.
14. A. Drucker and R. de Wolf. Quantum proofs for classical theorems. Theory Comput., Graduate Surveys, 2, 2011.
15. Y. Faenza, S. Fiorini, R. Grappe, and H. R. Tiwary. Extended formulations, non-negative factorizations and randomized communication protocols. arXiv:1105.4127, 2011.
16. W. Fernandez de la Vega and C. Mathieu. Linear programming relaxation of Maxcut. In Proc. SODA 2007, pages 53-61, 2007.
17. S. Fiorini, V. Kaibel, K. Pashkovich, and D. O. Theis. Combinatorial bounds on nonnegative rank and extended formulations. arXiv:1111.0444, 2011.
18. 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. SIAM J. Comput., 39:3553-3570, 2010.
19. K. Georgiou, A. Magen, and M. Tulsiani. Optimal Sherali-Adams gaps from pairwise independence. In Proc. APPROX-RANDOM 2009, pages 125-139, 2009.
20. J. Gouveia, P.A. Parrilo, and R. Thomas. Theta bodies for polynomial ideals. SIAM J. Optim., 20:2097-2118, 2010.
21. J. Gouveia, P.A. Parrilo, and R. Thomas. Lifts of convex sets and cone factorizations. arXiv:1111.3164, 2011.
22. H. Huang and B. Sudakov. A counterexample to the alon-saks-seymour conjecture and related problems. arXiv:1002.4687, 2010.
23. V. Kaibel. Extended formulations in combinatorial optimization. Optima, 85:2-7, 2011.
24. V. Kaibel, K. Pashkovich, and D.O. Theis. Symmetry matters for the sizes of extended formulations. In Proc. IPCO 2010, pages 135-148, 2010.
25. I. Kerenidis and R. de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. In Proc. STOC 2003, pages 106-115, 2003.
26. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, 1997.
27. E. Kushilevitz and E. Weinreb. The communication complexity of set-disjointness with small sets and 0-1 intersection. In Proc. FOCS 2009, pages 63-72, 2009.
28. E. Kushilevitz and E. Weinreb. On the complexity of communication complexity. In Proc. STOC 2009, pages 465-474, 2009.
29. C. Lemaréchal and J.B. Hiriart-Urruty. Convex analysis and minimization algorithms I. Springer, 1996.
30. L. Lovász. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory, 25:1-7, 1979.
31. L. Lovász. Semidefinite programs and combinatorial optimization. In Recent advances in algorithms and combinatorics, volume 11 of CMS Books Math./Ouvrages Math. SMC, pages 137-194. Springer, 2003.
32. L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim., 1:166-190, 1991.
33. N.D. Mermin. Quantum computer science: an introduction. Cambridge University Press, 2007.
34. M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information. Cambridge University Press, 2000.
35. K. Pashkovich. Symmetry in extended formulations of the permutahedron. arXiv:0912.3446, 2009.
36. A. A. Razborov. On the distributional complexity of disjointness. Theoret. Comput. Sci., 106(2):385-390, 1992.
37. T. Rothvoß. Some 0/1 polytopes need exponential size extended formulations. arXiv:1105.0036, 2011.
38. G. Schoenebeck, L. Trevisan, and M. Tulsiani. Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut. In Proc. STOC 2007, pages 302-310, 2007.
39. A. Schrijver. Combinatorial optimization. Polyhedra and efficiency. Springer-Verlag, 2003.
40. C. E. Shannon. The synthesis of two-terminal switching circuits. Bell System Tech. J., 25:59-98, 1949.
41. 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:411-430, 1990.
42. E. R. Swart. P = NP. Technical report, University of Guelph, 1986; revision 1987.
43. F. Vanderbeck and L. A. Wolsey. Reformulation and decomposition of integer programs. In M. Jünger et al., editor, 50 Years of Integer Programming 1958-2008, pages 431-502. Springer, 2010.
44. R. de Wolf. Quantum communication and complexity. Theoret. Comput. Sci., 287:337-353, 2002.
45. R. de Wolf. Nondeterministic quantum query and communication complexities. SIAM J. Comput., 32:681-699, 2003.
46. L. A. Wolsey. Using extended formulations in practice. Optima, 85:7-9, 2011.
47. M. Yannakakis. Expressing combinatorial optimization problems by linear programs (extended abstract). In Proc. STOC 1988, pages 223-228, 1988.
48. M. Yannakakis. Expressing combinatorial optimization problems by linear programs. J. Comput. System Sci., 43(3):441-466, 1991.
49. G. M. Ziegler. Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. Springer-Verlag, 1995.