arXiv · math/0508154
Euclidean distortion and the Sparsest Cut
Abstract
We prove that every $n$-point metric space of negative type (and, in particular, every $n$-point subset of $L_1$) embeds into a Euclidean space with distortion $O(\sqrt{\log n} \cdot\log \log n)$, a result which is tight up to the iterated logarithm factor. As a consequence, we obtain the best known polynomial-time approximation algorithm for the Sparsest Cut problem with general demands. Namely, if the demand is supported on a subset of size $k$, we achieve an approximation ratio of $O(\sqrt{\log k}\cdot \log \log k)$.
Explore related subjects
Keep this discovery
Sanjeev Arora, James R. Lee, Assaf Naor. 2005-08-08. Euclidean distortion and the Sparsest Cut. https://arxiv.org/abs/math/0508154
Cite the original work for its findings. Save a collection to share your selection of sources.