Fetching the paper…
Reading the bibliography…
The positive semidefinite rank of a nonnegative $(m\times n)$-matrix~$S$ is the minimum number~$q$ such that there exist positive semidefinite $(q\times q)$-matrices $A_1,\dots,A_m$, $B_1,\dots,B_n$ such that $S(k,\ell) = \mbox{tr}(A_k^* B_\ell)$.
G. Dantzig, R. Fulkerson, and S. Johnson, Solution of a large-scale Traveling Salesman Problem , Oper. Res. 2
1954
Earlier work this paper cites.
T. L. Markham, Factorizations of nonnegative matrices , Proc. Amer. Math. Soc. 32
1972
Earlier work this paper cites.
James Orlin, Contentment in graph theory: covering graphs with cliques , Nederl. Akad. Wetensch. Proc. Ser. A 80
1977
Earlier work this paper cites.
D. A. Gregory and N. J. Pullman, Semiring rank: Boolean rank and nonnegative rank factorizations , J. Combin. Inform. System Sci. 8
1983
Earlier work this paper cites.
Mihalis Yannakakis, Expressing combinatorial optimization problems by linear programs , J. Comput. System Sci. 43
1991
Earlier work this paper cites.
A. A. Razborov, On the distributional complexity of disjointness , Theoret. Comput. Sci. 106
1992
Earlier work this paper cites.
Joel E. Cohen and Uriel G. Rothblum, Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , Linear Algebra Appl. 190
1993
Earlier work this paper cites.
Michel X. Goemans and David P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , J. Assoc. Comput. Mach. 42
1995
Cited alongside, same era.
Eyal Kushilevitz and Noam Nisan, Communication complexity , Cambridge University Press, Cambridge, 1997. MR 1426129 (98c:68074)
1997
Cited alongside, same era.
Dragoš Cvetković, Mirjana Čangalović, and Vera Kovačević-Vujčić, Semidefinite programming methods for the symmetric traveling salesman problem , Integer programming and combinatorial optimization (Graz, 1999), Lecture Notes in Comput. Sci., vol. 1610, Springer, Berlin, 1999, pp. 126–136. MR 1709377 (2001e:90067)
1999
Cited alongside, same era.
Alexander Barvinok, A course in convexity , Graduate Studies in Mathematics, American Mathematical Society, 2002
2002
Cited alongside, same era.
Nicolas Gillis and François Glineur, On the geometric interpretation of the nonnegative rank , submitted, 2011
2011
Later among the works it cites.
2011
Later among the works it cites.
Volker Kaibel, Extended formulations in Combinatorial Optimization , Optima – Mathematical Optimization Society Newsletter 85
2011
Later among the works it cites.
2012
Closest in time.
Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, and Ronald de Wolf, Linear vs. semidefinite extended formulations: Exponential separation and strong lower bounds , STOC, 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
LeRoy B. Beasley and Thomas J. Laffey, Real rank versus nonnegative rank , Linear Algebra Appl. 431
2009
Cited alongside, same era.
Volker Kaibel, Kanstantsin Pashkovich, and Dirk Oliver Theis, Symmetry matters for the sizes of extended formulations , Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., vol. 6080, Springer, Berlin, 2010, pp. 135–148. MR 2661094 (2011k:05125)
2010
Cited alongside, same era.
by same author, Symmetry matters for the sizes of extended formulations , SIAM J. Discrete Math. (to appear)
Cited in the paper.
2012
Closest in time.
2012
Closest in time.
Dirk Oliver Theis, Extension complexity and factorization rank over arbitrary cones , Blog post, May 2012, http://dirkolivertheis.wordpress.com/2012/05/12/extcplxty-facrk-arbitrary-cones/
2012
Closest in time.