Improved lower bounds for embeddings into l 1

Robert Krauthgamer*, Yuval Rabani

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

33 Scopus citations

Abstract

We improve upon recent lower bounds on the minimum distortion of embedding certain finite metric spaces into L1. In particular, we show that for every n ≥ 1, there is an n-point metric space of negative type that requires a distortion of ω(log log n) for such an embedding, implying the same lower bound on the integrality gap of a well-known semidefinite programming relaxation for sparsest cut. This result builds upon and improves the recent lower bound of (log log n) 1/6-o(1) due to Khot and Vishnoi [The unique games conjecture, integrality gap for cut problems and the embeddability of negative type metrics into l 1, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 2005, pp. 53-62]. We also show that embedding the edit distance metric on {0, 1} n into L 1 requires a distortion of Ω(log n). This result improves a very recent (log n) 1/2-o(1) lower bound by Khot and Naor [Nonembeddability theorems via Fourier analysis, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 2005, pp. 101-112].

Original languageAmerican English
Pages (from-to)2487-2498
Number of pages12
JournalSIAM Journal on Computing
Volume38
Issue number6
DOIs
StatePublished - 2009
Externally publishedYes

Keywords

  • Approximation algorithms
  • Edit distance
  • Graph partitioning
  • Integrality gap
  • Metric embeddings
  • Negative type metrics
  • Semidefinite programming relaxation

Fingerprint

Dive into the research topics of 'Improved lower bounds for embeddings into l 1'. Together they form a unique fingerprint.

Cite this