The following pages link to Quadratic forms on graphs (Q5901109):
Displaying 8 items.
- Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- The Grothendieck constant of random and pseudo-random graphs (Q951106) (← links)
- Additive approximation algorithms for modularity maximization (Q2221809) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- (Q5743431) (← links)
- Approximating sparse quadratic programs (Q6180751) (← links)
