Fetching the paper…
Reading the bibliography…
Given a graph $G=([n],E)$ and $w\in\R^E$, consider the integer program ${\max}_{x\in \{\pm 1\}^n} \sum_{ij \in E} w_{ij}x_ix_j$ and its canonical semidefinite programming relaxation ${\max} \sum_{ij \in E} w_{ij}v_i^Tv_j$, where the maximum is taken over all unit vectors $v_i\in\R^n$.
Über eine Eigenschaft der ebenen Komplexe
K. Wagner · 1937
Earlier work this paper cites.
Résumé de la théorie métrique des produits tensoriels topologiques
A. Grothendieck · 1953
Earlier work this paper cites.
Sur la constante de Grothendieck
J. Krivine · 1977
Earlier work this paper cites.
On the Shannon capacity of a graph
L. Lovász · 1979
Earlier work this paper cites.
The max-cut problem on graphs not contractible to K 5 K_{5}
F. Barahona · 1983
Earlier work this paper cites.
On the cut polytope
F. Barahona and A. Mahjoub · 1986
Earlier work this paper cites.
A new lower bound on the real Grothendieck constant
J.A. Reeds · 1991
Earlier work this paper cites.
The real positive definite completion problem for a simple cycle
W.W. Barrett, C.R. Johnson, and P. Tarazaga · 1993
Cited alongside, same era.
Combinatorial properties and the complexity of a max-cut approximation
S. Poljak. C. Delorme · 1993
Cited alongside, same era.
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
S. Poljak. C. Delorme · 1993
Cited alongside, same era.
Bell inequalities, Grothendieck’s constant, and root two. SIAM J. Disc. Math.,
P.C. Fishburn and J.A. Reeds · 1994
Cited alongside, same era.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM,
M.X. Goemans and D.P. Williamson · 1995
Cited alongside, same era.
Geometry of Cuts and Metrics
M.M. Deza and M. Laurent · 1997
Approximating the cut-norm via Grothendieck’s inequality
N. Alon and A. Naor · 2004
Later among the works it cites.
M. Laurent. Semidefinite relaxations for Max-Cut. In The Sharpest Cut: The Impact of Manfred Padberg and His Work
2004
Later among the works it cites.
On non-approximability for quadratic programs
S. Arora, E. Berger, G. Kindler, M. Safra, and E. Hazan · 2005
Later among the works it cites.
Quadratic forms on graphs
N. Alon, K. Makarychev, Y. Makarychev, and A. Naor · 2006
Later among the works it cites.
Tsirelson bounds for generalized Clauser-Horne-Shimony-Holt inequalities
S. Wehner · 2006
Later among the works it cites.
I. Pitowsky. New Bell inequalities for the singlet state: Going beyond the Grothendieck bound. Journal of Mathematical Physics
2008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
The real positive semidefinite completion problem for series-parallel graphs
M. Laurent · 1997
Cited alongside, same era.
The Grothendieck constant is strictly smaller than Krivine’s bound. Preprint, arXiv:1103.6161v2
M. Braverman, K. Makarychev, Y. Makarychev, and A. Naor
Cited in the paper.
Cited in the paper.
Later among the works it cites.