DocumentCode
1963855
Title
A $(log n)^{Omega(1)}$ Integrality Gap for the Sparsest Cut SDP
Author
Cheeger, Jeff ; Kleiner, Bruce ; Naor, Assaf
Author_Institution
Courant Inst., New York Univ., New York, NY, USA
fYear
2009
fDate
25-27 Oct. 2009
Firstpage
555
Lastpage
564
Abstract
We show that the Goemans-Linial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap (log n)Ω(1). This is achieved by exhibiting n-point metric spaces of negative type whose L1 distortion is (log n)Ω(1). Our result is based on quantitative bounds on the rate of degeneration of Lipschitz maps from the Heisenberg group to L1 when restricted to cosets of the center.
Keywords
computational complexity; graph theory; mathematical programming; Goemans-Linial semidefinite relaxation; Heisenberg group; Lipschitz map; SDP; integrality gap; semidefinite programming; sparsest cut problem; Algorithm design and analysis; Approximation algorithms; Computer science; Extraterrestrial measurements; Hilbert space; Linear programming; NP-hard problem; Polynomials; USA Councils; Upper bound; Heisenberg group; Sparsest Cut problem; integrality gap; metric embeddings; semidefinite programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on
Conference_Location
Atlanta, GA
ISSN
0272-5428
Print_ISBN
978-1-4244-5116-6
Type
conf
DOI
10.1109/FOCS.2009.47
Filename
5438599
Link To Document