The matching polytope has exponential extension complexity

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2014, Pages 263-272

  Rothvoss, Thomas ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Combinatorial optimization; Linear programming relaxations; Polytopes

Indexed keywords

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING; TOPOLOGY;

EXTENSION COMPLEXITY; EXTRA VARIABLES; HIGHER-DIMENSIONAL; LINEAR PROGRAMMING RELAXATION; LINEAR PROGRAMS; MATCHING POLYTOPE; PERFECT MATCHINGS; POLYTOPES;

POLYNOMIALS;

EID: 84904344976     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2591796.2591834     Document Type: Conference Paper

References (28)

1. D. Avis and H. R. Tiwary. On the extension complexity of combinatorial polytopes. In ICALP (1), pages 57-68, 2013.
2. E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods, 6(3):466-486, 1985.
3. F. Barahona. On cuts and matchings in planar graphs. Mathematical Programming, 60:53-68, 1993. 10.1007/BF01580600.
4. J Briët, D. Dadush, and S. Pokutta. On the existence of 0/1 polytopes with high semidefinite extension complexity. In ESA, pages 217-228, 2013.
5. G. Braun, S. Fiorini, S. Pokutta, and D. Steurer. Approximation limits of linear programs (beyond hierarchies). In FOCS, pages 480-489, 2012.
6. M. Braverman and A. Moitra. An information complexity approach to extended formulations. In STOC, pages 161-170, 2013.
7. G. Braun and S. Pokutta. Common information and unique disjointness. Electronic Colloquium on Computational Complexity (ECCC), 20:56, 2013.
8. S. O. Chan, J. R. Lee, P. Raghavendra, and D. Steurer. Approximate constraint satisfaction requires large lp relaxations. FOCS'13, 2013.
9. J. Edmonds. Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Nat. Bur. Standards Sect. B, 69B:125-130, 1965.
10. J. Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1(1):127-136, 1971.
11. Y. Faenza, S. Fiorini, R. Grappe, and H. R. Tiwary. Extended formulations, nonnegative factorizations, and randomized communication protocols. In ISCO, pages 129-140, 2012.
12. S. Fiorini. Personal communication, 2013.
13. S Fiorini, V. Kaibel, K. Pashkovich, and D. O. Theis. Combinatorial bounds on nonnegative rank and extended formulations. Discrete Mathematics, 313(1):67-83, 2013.
14. S. Fiorini, S. Massar, S. Pokutta, H. Tiwary, and R. de Wolf. Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. pages 95-106, 2012.
15. S. Fiorini, T. Rothvoß, and H. R. Tiwary. Extended formulations for polygons. Discrete & Computational Geometry, 48(3):658-668, 2012.
16. A. M. H. Gerards. Compact systems for t-join and perfect matching polyhedra of graphs with bounded genus. Operations Research Letters, 10(7):377-382, 1991.
17. M. Goemans. Smallest compact formulation for the permutahedron. Working paper. http://math.mit.edu/goemans/PAPERS/permutahedron.pdf, 2010.
18. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115-1145, 1995.
19. V. Kaibel, K. Pashkovich, and D. O. Theis. Symmetry matters for the sizes of extended formulations. In IPCO, pages 135-148, 2010.
20. R. Kipp Martin. Using separation algorithms to generate mixed integer model reformulations. Operations Research Letters, 10(3):119-128, 1991.
21. M. Mitzenmacher and E. Upfal. Probability and computing - randomized algorithms and probabilistic analysis. Cambridge University Press, 2005.
22. M. Padberg and M. Rao. Odd minimum cut-sets and b-matchings. Mathematics of Operations Research, pages 7:67-80, 1982.
23. S. Pokutta and M. Van Vyve. A note on the extension complexity of the knapsack polytope. Oper. Res. Lett., 41(4):347-350, 2013.
24. A. Razborov. On the distributional complexity of disjointness. In ICALP, pages 249-253, 1990.
25. T. Rothvoss. Some 0/1 polytopes need exponential size extended formulations. Mathematical Programming, pages 1-14, 2012.
26. A. Schrijver. Combinatorial optimization. Polyhedra and efficiency. Vol. A,B,C, volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2003.
27. P. Ventura and F. Eisenbrand. A compact linear program for testing optimality of perfect matchings. Oper. Res. Lett., 31(3):429-434, 2003.
28. M. Yannakakis. Expressing combinatorial optimization problems by linear programs. Journal of Computer and System Sciences, 43(3):441-466, 1991.