Combinatorial bounds on nonnegative rank and extended formulations

Discrete Mathematics

Volumn 313, Issue 1, 2013, Pages 67-83

  Fiorini, Samuel ^a   Kaibel, Volker ^b   Pashkovich, Kanstantsin ^b   Theis, Dirk Oliver ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Biclique covering in bipartite graphs; Boolean rank; Extended formulations; Nonnegative rank; Projections of polytopes

Indexed keywords

EID: 84867204452     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2012.09.015     Document Type: Article

References (37)

1. E. Balas Disjunctive programming and a hierarchy of relaxations for discrete optimization problems SIAM J. Algebr. Discrete Methods 6 1985 466 486
2. LeRoy B. Beasley, and Thomas J. Laffey Real rank versus nonnegative rank Linear Algebra Appl. 431 12 2009 2330 2335
3. A. Ben-Tal, and A. Nemirovski On polyhedral approximations of the second-order cone Math. Oper. Res. 26 2 2001 193 205
4. V. Chvátal On certain polytopes associated with graphs J. Combin. Theory Ser. B 18 1975 138 154
5. M. Conforti, G. Cornuéjols, and G. Zambelli Extended formulations in combinatorial optimization 4OR 8 1 2010 1 48
6. D. de Caen, D.A. Gregory, N.J. Pullman, The Boolean rank of zero-one matrices, in: Proceedings of the Third Caribbean Conference on Combinatorics and Computing (Bridgetown, 1981), Cave Hill Campus, Barbados, 1981. Univ. West Indies, pp. 169-173.
7. M. Dietzfelbinger, J. Hromkovič, and G. Schnitger A comparison of two lower-bound methods for communication complexity Theoret. Comput. Sci. 168 1 1996 39 51 19th International Symposium on Mathematical Foundations of Computer Science (Košice, 1994)
8. Faun C.C. Doherty, J. Richard Lundgren, Daluss J. Siewert, Biclique covers and partitions of bipartite graphs and digraphs and related matrix ranks of 0, 1 -matrices, in: Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999), volume 136, 1999, pp. 73-96.
9. J. Edmonds Maximum matching and a polyhedron with 0, 1 vertices J. Res. Natl. Bur. Stand. 69B 1965 125 130
10. Y. Faenza, S. Fiorini, R. Grappe, H.R. Tiwary, Extended formulations, non-negative factorizations and randomized communication protocols. arXiv:1105.4127, 2011.
11. S. Fiorini, S. Massar, S. Pokutta, H.R. Tiwary, R. de Wolf, Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds, in: Proc. STOC 2012, 2012 pp. 95-106.
12. S. Fiorini, T. Rothvoß, H.R. Tiwary, Extended formulations for polygons. arXiv:1107.0371, 2011.
13. N. Gillis, F. Glineur, On the geometric interpretation of the nonnegative rank. arXiv:1009.0880, 2010.
14. M.X. Goemans, Smallest compact formulation for the permutahedron. Manuscript, 2009.
15. João Gouveia, Pablo A. Parrilo, Rekha Thomas, Lifts of convex sets and cone factorizations, Math. Oper. Res. arXiv:1111.3164, 2012+ (in press).
16. D.A. Gregory, and N.J. Pullman Semiring rank: boolean rank and nonnegative rank factorizations J. Comb. Inf. Syst. Sci. 8 3 1983 223 233
17. M. Habib, L. Nourine, O. Raynaud, and E. Thierry Computational aspects of the 2-dimension of partially ordered sets Theoret. Comput. Sci. 312 2-3 2004 401 431
18. H. Huang, B. Sudakov, A counterexample to the Alon-Saks-Seymour conjecture and related problems. arXiv:1002.4687, 2010.
19. V. Kaibel Extended formulations in combinatorial optimization Optima 85 2011 2 7
20. V. Kaibel, A. Loos, Finding descriptions of polytopes via extended formulations and liftings. Chap. 4 of: Combinatorial Optimization - ISCO2010: Recent Progress. Ridha Mahjoub (ed.) Wiley-ISTE, 2011 (in press). arXiv:1109.0815.
21. V. Kaibel, K. Pashkovich, Constructing extended formulations from reflection relations, in: Proc. IPCO 2011, 2011, pp. 287-300.
22. V. Kaibel, K. Pashkovich, D.O. Theis, Symmetry matters for the sizes of extended formulations, in: Proc. IPCO 2010, 2010, pp. 135-148.
23. M. Karchmer, E. Kushilevitz, and N. Nisan Fractional covers and communication complexity SIAM J. Discrete Math. 8 1 1995 76 92
24. E. Kushilevitz, and N. Nisan Communication Complexity 1997 Cambridge University Press Cambridge
25. Cony M. Lau, and Thomas L. Markham Factorization of nonnegative matrices. II Linear Algebra Appl. 20 1 1978 51 56
26. L. Lovász On the ratio of optimal integral and fractional covers Discrete Math. 13 4 1975 383 390
27. R.K. Martin Using separation algorithms to generate mixed integer model reformulations Oper. Res. Lett. 10 3 1991 119 128
28. K. Pashkovich, Symmetry in extended formulations of the permutahedron. arXiv:0912.3446, 2009.
29. T. Rothvoß, Some 01 polytopes need exponential size extended formulations. arXiv:1105.0036, 2011.
30. A. Schrijver Combinatorial Optimization. Polyhedra and Efficiency. Vol. B Algorithms and Combinatorics vol. 24 2003 Springer-Verlag Berlin Matroids, trees, stable sets, Chapters 39-69
31. P. Turán On an extremal problem in graph theory Mat. és Fzikiai Lapok 48 1941 436 452
32. Z. Tuza Covering of graphs by complete bipartite subgraphs: complexity of 0-1 matrices Combinatorica 4 1984 111 116
33. F. Vanderbeck, and L.A. Wolsey Reformulation and decomposition of integer programs M. Jünger, 50 Years of Integer Programming 1958-2008 2010 Springer 431 502
34. S.A. Vavasis On the complexity of nonnegative matrix factorization SIAM J. Optim. 20 3 2009 1364 1377
35. M. Yannakakis Expressing combinatorial optimization problems by linear programs J. Comput. System Sci. 43 3 1991 441 466
36. A.C. Yao, Some complexity questions related to distributed computing, in: Proc. STOC 1979, 1979, pp. 209-213.
37. G.M. Ziegler Lectures on Polytopes Graduate Texts in Mathematics vol. 152 1995 Springer-Verlag Berlin