On the extension complexity of combinatorial polytopes

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete problems including subset-sum and three dimensional matching. We then obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cubic planar graphs.

[1]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[2]  Tsuyoshi Ito,et al.  Two-party Bell inequalities derived from combinatorics via triangular elimination , 2005 .

[3]  G. Ziegler.  Lectures on Polytopes , 1994 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Thomas Rothvoß,et al.  Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..

[6]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

[7]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[8]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[9]  F. Barahona.  The max-cut problem on graphs not contractible to K5 , 1983 .

[10]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[11]  M. Ziegler.  Volume 152 of Graduate Texts in Mathematics , 1995 .

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[13]  Ronald de Wolf,et al.  Nondeterministic Quantum Query and Communication Complexities , 2003, SIAM J. Comput..

[14]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[15]  Tsuyoshi Ito,et al.  Generating facets for the cut polytope of a graph by triangular elimination , 2008, Math. Program..

[16]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[17]  Sebastian Pokutta,et al.  A note on the extension complexity of the knapsack polytope , 2013, Oper. Res. Lett..

[18]  V. Kaibel.  Extended Formulations in Combinatorial Optimization , 2011, 1104.1023.

[19]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.