A $(\log n)^{\Omega(1)}$ integrality gap for the Sparsest Cut SDP
Jeff Cheeger, Bruce Kleiner, Assaf Naor

TL;DR
This paper demonstrates a significant integrality gap for the Sparsest Cut SDP, showing that the relaxation can be far from optimal due to complex metric space properties.
Contribution
It establishes a logarithmic lower bound on the integrality gap for the Sparsest Cut SDP using advanced metric space analysis.
Findings
Existence of n-point metric spaces with high L1 distortion
Quantitative bounds on Lipschitz map degeneration from the Heisenberg group
Demonstration of a logarithmic integrality gap for the SDP
Abstract
We show that the Goemans-Linial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap . This is achieved by exhibiting -point metric spaces of negative type whose distortion is . Our result is based on quantitative bounds on the rate of degeneration of Lipschitz maps from the Heisenberg group to when restricted to cosets of the center.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Nonlinear Partial Differential Equations
