research-article

The matching polytope has exponential extension complexity

Author:

Thomas RothvossAuthors Info & Claims

STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing

Pages 263 - 272

https://doi.org/10.1145/2591796.2591834

Published: 31 May 2014 Publication History

Abstract

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a polynomial. After two decades of standstill, recent years have brought amazing progress in showing lower bounds for the so called extension complexity, which for a polytope P denotes the smallest number of inequalities necessary to describe a higher dimensional polytope Q that can be linearly projected on P.

However, the central question in this field remained wide open: can the perfect matching polytope be written as an LP with polynomially many constraints?

We answer this question negatively. In fact, the extension complexity of the perfect matching polytope in a complete n-node graph is 2^Ω(n). By a known reduction this also improves the lower bound on the extension complexity for the TSP polytope from 2^Ω(√n) to 2^Ω(n).

Supplementary Material

MP4 File (p263-sidebyside.mp4)

Download
242.90 MB

References

[1]

{AT13} D. Avis and H. R. Tiwary. On the extension complexity of combinatorial polytopes. In ICALP (1), pages 57--68, 2013.

Digital Library

[2]

{Bal85} E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods, 6(3):466--486, 1985.

Digital Library

[3]

{Bar93} F. Barahona. On cuts and matchings in planar graphs. Mathematical Programming, 60:53--68, 1993. 10.1007/BF01580600.

Digital Library

[4]

{BDP13} 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]

{BFPS12} G. Braun, S. Fiorini, S. Pokutta, and D. Steurer. Approximation limits of linear programs (beyond hierarchies). In FOCS, pages 480--489, 2012.

Digital Library

[6]

{BM13} M. Braverman and A. Moitra. An information complexity approach to extended formulations. In STOC, pages 161--170, 2013.

Digital Library

[7]

{BP13} G. Braun and S. Pokutta. Common information and unique disjointness. Electronic Colloquium on Computational Complexity (ECCC), 20:56, 2013.

[8]

{CLRS13} S. O. Chan, J. R. Lee, P. Raghavendra, and D. Steurer. Approximate constraint satisfaction requires large lp relaxations. FOCS'13, 2013.

Digital Library

[9]

{Edm65} J. Edmonds. Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Nat. Bur. Standards Sect. B, 69B:125--130, 1965.

[10]

{Edm71} J. Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1(1):127--136, 1971.

Digital Library

[11]

{FFGT12} Y. Faenza, S. Fiorini, R. Grappe, and H. R. Tiwary. Extended formulations, nonnegative factorizations, and randomized communication protocols. In ISCO, pages 129--140, 2012.

Digital Library

[12]

{Fio13} S. Fiorini. Personal communication, 2013.

[13]

{FKPT13} 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]

{FMP⁺12} 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.

Digital Library

[15]

{FRT12} S. Fiorini, T. Rothvos, and H. R. Tiwary. Extended formulations for polygons. Discrete & Computational Geometry, 48(3):658--668, 2012.

Digital Library

[16]

{Ger91} 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.

Digital Library

[17]

{Goe10} M. Goemans. Smallest compact formulation for the permutahedron. Working paper. http://math.mit.edu/goemans/PAPERS/permutahedron.pdf, 2010.

[18]

{GW95} 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.

Digital Library

[19]

{KPT10} V. Kaibel, K. Pashkovich, and D. O. Theis. Symmetry matters for the sizes of extended formulations. In IPCO, pages 135--148, 2010.

Digital Library

[20]

{Mar91} R. Kipp Martin. Using separation algorithms to generate mixed integer model reformulations. Operations Research Letters, 10(3):119--128, 1991.

Digital Library

[21]

{MU05} M. Mitzenmacher and E. Upfal. Probability and computing - randomized algorithms and probabilistic analysis. Cambridge University Press, 2005.

Digital Library

[22]

{PR82} M. Padberg and M. Rao. Odd minimum cut-sets and b-matchings. Mathematics of Operations Research, pages 7:67--80, 1982.

[23]

{PV13} 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]

{Raz90} A. Razborov. On the distributional complexity of disjointness. In ICALP, pages 249--253, 1990.

Digital Library

[25]

{Rot12} T. Rothvoss. Some 0/1 polytopes need exponential size extended formulations. Mathematical Programming, pages 1--14, 2012.

[26]

{Sch03} A. Schrijver. Combinatorial optimization. Polyhedra and efficiency. Vol. A,B,C, volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2003.

[27]

{VE03} P. Ventura and F. Eisenbrand. A compact linear program for testing optimality of perfect matchings. Oper. Res. Lett., 31(3):429--434, 2003.

Digital Library

[28]

{Yan91} M. Yannakakis. Expressing combinatorial optimization problems by linear programs. Journal of Computer and System Sciences, 43(3):441--466, 1991.

Cited By

de Rezende SGöös MRobere R(2022)Guest ColumnACM SIGACT News10.1145/3532737.353274653:1(59-82)Online publication date: 20-Apr-2022
https://dl.acm.org/doi/10.1145/3532737.3532746
Aprile M(2022)Extended formulations for matroid polytopes through randomized protocolsOperations Research Letters10.1016/j.orl.2022.01.01150:2(145-149)Online publication date: Mar-2022
https://doi.org/10.1016/j.orl.2022.01.011
Fawzi H(2021)On Polyhedral Approximations of the Positive Semidefinite ConeMathematics of Operations Research10.1287/moor.2020.107746:4(1479-1489)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1287/moor.2020.1077
Show More Cited By

Index Terms

The matching polytope has exponential extension complexity
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

The Matching Polytope has Exponential Extension Complexity

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a polynomial. After ...
The boolean quadric polytope: Some characteristics, facets and relatives

We study unconstrained quadratic zero---one programming problems havingn variables from a polyhedral point of view by considering the Boolean quadric polytope QPn inn(n+1)/2 dimensions that results from the linearization of the quadratic form. We show ...
Facets of the Asymmetric Traveling Salesman Polytope

In this paper we consider the Asymmetric Traveling Salesman polytope, P_n, defined as the convex hull of the incidence vectors of tours in a complete digraph with n vertices, and its monotonization, P̃_n. Several classes of valid inequalities for both ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing

May 2014

984 pages

ISBN:9781450327107

DOI:10.1145/2591796

Program Chair:
David Shmoys
Cornell University

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 May 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

STOC '14

Sponsor:

SIGACT

STOC '14: Symposium on Theory of Computing

May 31 - June 3, 2014

New York, New York

Acceptance Rates

STOC '14 Paper Acceptance Rate 91 of 319 submissions, 29%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

76
Total Citations
View Citations
279
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

de Rezende SGöös MRobere R(2022)Guest ColumnACM SIGACT News10.1145/3532737.353274653:1(59-82)Online publication date: 20-Apr-2022
https://dl.acm.org/doi/10.1145/3532737.3532746
Aprile M(2022)Extended formulations for matroid polytopes through randomized protocolsOperations Research Letters10.1016/j.orl.2022.01.01150:2(145-149)Online publication date: Mar-2022
https://doi.org/10.1016/j.orl.2022.01.011
Fawzi H(2021)On Polyhedral Approximations of the Positive Semidefinite ConeMathematics of Operations Research10.1287/moor.2020.107746:4(1479-1489)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1287/moor.2020.1077
Rao AYehudayoff A(2020)Communication Complexity10.1017/9781108671644Online publication date: 30-Jan-2020
https://doi.org/10.1017/9781108671644
Sharifov FHulianytskyi L(2020)Cuts in Undirected Graphs. IICybernetics and Systems Analysis10.1007/s10559-020-00292-z56:5(745-752)Online publication date: 2-Oct-2020
https://doi.org/10.1007/s10559-020-00292-z
Wolsey L(2020)ReferencesInteger Programming10.1002/9781119606475.refs(291-309)Online publication date: 19-Sep-2020
https://doi.org/10.1002/9781119606475.refs
Шитов ЯShitov Y(2019)Тропические нижние оценки для расширений многогранников. II. Графы несоответствияTropical lower bounds for extended formulations. II: Deficiency graphs of matricesИзвестия Российской академии наук. Серия математическаяIzvestiya Rossiiskoi Akademii Nauk. Seriya Matematicheskaya10.4213/im869883:1(203-216)Online publication date: 2019
https://doi.org/10.4213/im8698
Ahmadinejad ADehghani SHajiaghayi MLucier BMahini HSeddighin S(2019)From Duels to Battlefields: Computing Equilibria of Blotto and Other GamesMathematics of Operations Research10.1287/moor.2018.0971Online publication date: 31-May-2019
https://doi.org/10.1287/moor.2018.0971
Oliveira MPudlák P(2019)Representations of Monotone Boolean Functions by Linear ProgramsACM Transactions on Computation Theory10.1145/333778711:4(1-31)Online publication date: 20-Jul-2019
https://dl.acm.org/doi/10.1145/3337787
Faran RKupferman O(2019)A Parametrized Analysis of Algorithms on Hierarchical GraphsInternational Journal of Foundations of Computer Science10.1142/S012905411940025230:06n07(979-1003)Online publication date: 19-Sep-2019
https://doi.org/10.1142/S0129054119400252
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents