Extended formulations, nonnegative factorizations, and randomized communication protocols

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

Volumn 7422 LNCS, Issue , 2012, Pages 129-140

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

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c Laboratoire d'Informatique de Paris Nord Villetaneuse   (France)

Author keywords

Communication protocols; Extended formulations; Nonnegative rank

Indexed keywords

EXTENDED FORMULATIONS; LOWER BOUNDS; NON-NEGATIVE FACTORIZATION; NON-NEGATIVE MATRIX; NONNEGATIVE RANK; PERFECT MATCHINGS; POLYTOPES;

ARTIFICIAL INTELLIGENCE; NETWORK PROTOCOLS;

COMBINATORIAL OPTIMIZATION;

EID: 84865253196     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32147-4_13     Document Type: Conference Paper

References (19)

1. Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory. In: 27th Annual Symposium on Foundations of Computer Science (FOCS 1986), pp. 337-347. IEEE Computer Society Press, Toronto (1986)
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. Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on non-negative rank and extended formulations, arXiv:1111.0444
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 (to appear, 2012)
9. Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. In: Algorithms and Combinatorics, 2nd edn., vol. 2. Springer, Berlin (1993)
10. Kaibel, V.: Extended formulations in combinatorial optimization. Optima 85, 2-7 (2011)
11. Kaibel, V., Pashkovich, K., Theis, D.O.: Symmetry Matters for the Sizes of Extended Formulations. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 135-148. Springer, Heidelberg (2010)
12. Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discr. Math. 5(4), 545-557 (1992)
13. Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1997)
14. Martin, R.K.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119-128 (1991)
15. Razborov, A.A.: On the distributional complexity of disjointness. Theor. Comput. Sci. 106(2), 385-390 (1992)
16. Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Algorithms and Combinatorics, vol. 24(A, B). Springer, Berlin (2003)
17. Vazirani, V.V.: Approximation algorithms. Springer (2001)
18. Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. System Sci. 43(3), 441-466 (1991)
19. Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, Berlin (1995)