Quadratic forms on graphs
From MaRDI portal
Publication:5901109
DOI10.1145/1060590.1060664zbMath1192.05168OpenAlexW2087789723MaRDI QIDQ5901109
Yury Makarychev, Konstantin Makarychev, Assaf Naor, Noga Alon
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060664
Programming involving graphs or networks (90C35) Graph theory (05C99) Quadratic and bilinear forms, inner products (15A63)
Related Items (8)
Approximating the little Grothendieck problem over the orthogonal and unitary groups ⋮ On approximating complex quadratic optimization problems via semidefinite programming relaxations ⋮ Approximating sparse quadratic programs ⋮ Additive approximation algorithms for modularity maximization ⋮ Tight bounds for parameterized complexity of cluster editing with a small number of clusters ⋮ The Grothendieck constant of random and pseudo-random graphs ⋮ Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope ⋮ Unnamed Item
This page was built for publication: Quadratic forms on graphs
