Extended formulations, nonnegative factorizations, and randomized communication protocols

Mathematical Programming

Volumn 153, Issue 1, 2015, Pages 75-94

  Faenza, Yuri ^a   Fiorini, Samuel ^b   Grappe, Roland ^c   Tiwary, Hans Raj ^d  

^a EPFL   (Switzerland)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c UNIVERSITÉ PARIS 13   (France)

^d CHARLES UNIVERSITY   (Czech Republic)

Author keywords

52B05

Indexed keywords

FACTORIZATION; GEOMETRY; SITE SELECTION; THEOREM PROVING;

52B05; COMMUNICATION COMPLEXITY; DETERMINISTIC PROTOCOLS; EXTENDED FORMULATIONS; FACTORIZATION THEOREMS; NON-NEGATIVE FACTORIZATION; NON-NEGATIVE MATRIX; POLYHEDRAL COMBINATORICS;

MATRIX ALGEBRA;

EID: 84941997801     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-014-0755-3     Document Type: Article

References (28)

1. Chattopadhyay, A., Pitassi, T.: The story of set disjointness. SIGACT News 41(3), 59–85 (2010)
2. Chvátal, V.: On certain polytopes associated with graphs. J. Comb. Theory B 18, 138–154 (1975)
3. Cohen, J.E., Rothblum, U.G.: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices. Linear Algebra Appl. 190, 149–168 (1993)
4. Conforti, M., Cornuéjols, G., Zambelli, G.: Extended formulations in combinatorial optimization. 4OR 8(1), 1–48 (2010)
5. Edmonds, J.: Maximum matching and a polyhedron with 0, 1 vertices. J. Res. Nat. Bur. Stand. 69B, 125–130 (1965)
6. Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1, 127–136 (1971)
7. Faenza, Y., Oriolo, G., Stauffer, G.: Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. In: Rabani, Y. (ed.) Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 1298–1308. SIAM, Japan (2012)
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: Proceedings of the 44th ACM Symposium on Theory of Computing (STOC 2012), pp. 95–106 (2012)
9. Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. Discret. Math. 313(1), 67–83 (2013)
10. Galluccio, A., Gentile, C., Ventura, P.: The stable set polytope of claw-free graphs with large stability number. Electron. Notes Discrete Math. 36, 1025–1032 (2010)
11. Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, volume 2 of Algorithms and Combinatorics., 2nd edn. Springer, Berlin (1993)
12. Høyer, P., de Wolf, R.: Improved quantum communication complexity bounds for disjointness and equality. In Proceedings of STACS, pp. 299–310 (2002)
13. Kaibel, V.: Extended formulations in combinatorial optimization. Optima 85, 2–7 (2011)
14. Kaibel, V., Pashkovich, K., Oliver, D.: Theis. Symmetry matters for the sizes of extended formulations. In: Proceedings of IPCO, pp. 135–148 (2010)
15. Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discr. Math. 5(4), 545–557 (1992)
16. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
17. Krause, M.: Geometric arguments yield better bounds for threshold circuits and distributed computing. Theor. Comput. Sci. 156(1&2), 99–117 (1996)
18. Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13(4), 383–390 (1975)
19. Richard, K.M.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119–128 (1991)
20. Razborov, A.A.: On the distributional complexity of disjointness. Theor. Comput. Sci. 106(2), 385–390 (1992)
21. Rothvoß, T.: Some 0/1 polytopes need exponential size extended formulations. arXiv:1105.0036 (2011)
22. Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Vol. A and B, Volume 24 of Algorithms and Combinatorics. Springer, Berlin (2003)
23. Thomason, A.: The extremal function for complete minors. Journal of Combinatorial Theory. Series B, Volume 81, Number 2. Academic Press, Inc., NY (2001)
24. Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441–466 (1991)
25. Williams, J.C.: A linear-size zero–one programming model for the minimum spanning tree problem in planar graphs. Networks 39(1), 53–60 (2002)
26. Wolsey, L.A.: Using extended formulations in practice. Optima 85, 7–9 (2011)
27. Zhang, S.: Quantum Strategic Game Theory. In Proceedings of the 3rd Innovations in, Theoretical Computer Science, pp. 39–59 (2012)
28. Ziegler, G.M.: Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. Springer, Berlin (1995)