Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

@inproceedings{Chawla2005EmbeddingsON,
  title={Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut},
  author={S. Chawla and A. Gupta and H. R{\"a}cke},
  booktitle={SODA '05},
  year={2005}
}
  • S. Chawla, A. Gupta, H. Räcke
  • Published in SODA '05 2005
  • Computer Science, Mathematics
  • In this paper, we study the metrics of <i>negative type</i>, which are metrics (<i>V</i>, d) such that √d is an Euclidean metric; these metrics are thus also known as "<i>l</i><inf>2</inf>-squared" metrics.We show how to embed <i>n</i>-point negative-type metrics into Euclidean space <i>l</i><inf>2</inf> with distortion <i>D</i> = <i>O</i>(log<sup>3/4</sup> <i>n</i>). This embedding result, in turn, implies an <i>O</i>(log<sup>3/4</sup> <i>k</i>)-approximation algorithm for the Sparsest Cut… CONTINUE READING
    95 Citations

    Figures and Topics from this paper.

    Improved lower bounds for embeddings into L1
    • 90
    • PDF
    Genus and the geometry of the cut graph
    • 28
    • PDF
    Hard Metrics from Cayley Graphs of Abelian Groups
    • 7
    • PDF
    Improved approximation algorithms for minimum-weight vertex separators
    • 264
    • PDF
    Improved lower bounds for embeddings into L 1
    • 81
    • PDF
    The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/
    • S. Khot, N. Vishnoi
    • Mathematics, Computer Science
    • 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
    • 2005
    • 74
    • PDF
    The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1
    • 280
    The asymptotic enhanced negative type of finite ultrametric spaces
    • 1
    • PDF
    Metric Dichotomies
    • 7
    • PDF

    References

    SHOWING 1-4 OF 4 REFERENCES
    On distance scales, embeddings, and efficient relaxations of the cut cone
    • J. Lee
    • Computer Science, Mathematics
    • SODA '05
    • 2005
    • 63
    • Highly Influential
    Small distortion and volume preserving embeddings for planar and Euclidean metrics
    • S. Rao
    • Computer Science, Mathematics
    • SCG '99
    • 1999
    • 184
    • Highly Influential
    • PDF
    Semidefinite programming in combinatorial optimization
    • M. Goemans
    • Mathematics, Computer Science
    • Math. Program.
    • 1997
    • 287
    • Highly Influential
    • PDF
    Semidefinite programming and combinatorial optimization
    • 35
    • Highly Influential