On the extension complexity of combinatorial polytopes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7965 LNCS, Issue PART 1, 2013, Pages 57-68

  Avis, David ^a,b   Tiwary, Hans Raj ^c  

^a MCGILL UNIVERSITY   (Canada)

^b KYOTO UNIVERSITY   (Japan)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CUBIC PLANAR GRAPHS; CUT POLYTOPE; EXTENSION COMPLEXITY; GRAPH MINORS; POLYTOPES; QUANTUM INFORMATION; SUBSET SUM; THREE DIMENSIONAL MATCHING;

COMPUTATIONAL COMPLEXITY; QUANTUM OPTICS;

AUTOMATA THEORY;

EID: 84880283489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39206-1_6     Document Type: Conference Paper

References (14)

1. Avis, D., Imai, H., Ito, T.: Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. 112(2), 303-325 (2008)
2. Avis, D., Imai, H., Ito, T., Sasaki, Y.: Two-party bell inequalities derived from combinatorics via triangular elimination. J. Phys. A: Math. General 38(50), 10971-10987 (2005)
3. Barahona, F.: The max-cut problem on graphs not contractible to K5 . Oper. Res. Lett. 2(3), 107-111 (1983)
4. Bell, J.S.: On the Einstein-Podolsky-Rosen paradox. Physics 1(3), 195-290 (1964)
5. Conforti, M., Cornuéjols, G., Zambelli, G.: Extended formulations in combinatorial optimization. 4OR 8, 1-48 (2010)
6. Corman, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press (2009)
7. Deza, M.M., Laurent, M.: Geometry of cuts and metrics. Algorithms and Combinatorics, vol. 15. Springer (1997)
8. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: STOC, pp. 95-106 (2012)
9. Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman (1979)
10. Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237-267 (1976)
11. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, Tatcher (eds.) Complexity of Computer Computations. Plenum (1974)
12. Rothvoß, T.: Some 0/1 polytopes need exponential size extended formulations. arXiv:1105.0036 (2011)
13. Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. Journal of Computer and System Sciences 43(3), 441-466 (1991)
14. Ziegler, G.M.: Lectures on polytopes. Graduate Texts in Mathematics, vol. 152. Springer (1995)