Bilipschitz snowflakes and metrics of negative type
Proceedings of the forty-second ACM symposium on Theory of computing
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximate Lasserre integrality gap for unique games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A PRG for lipschitz functions of polynomials with applications to sparsest cut
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We show that the Goemans-Linial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap $(\logn)^{\Omega(1)}$. This is achieved by exhibiting $n$-point metric spaces of negative type whose $L_1$ distortion is $(\logn)^{\Omega(1)}$. Our result is based on quantitative bounds on the rate of degeneration of Lipschitz maps from the Heisenberg group to $L_1$ when restricted to cosets of the center.