DMCA
Euclidean distortion and the Sparsest Cut (2005)
Cached
Download Links
- [www.ams.org]
- [www.cs.washington.edu]
- [homes.cs.washington.edu]
- [homes.cs.washington.edu]
- [arxiv.org]
- [arxiv.org]
- DBLP
Other Repositories/Bibliography
by
Sanjeev Arora
,
James R. Lee
,
Assaf Naor
| Venue: | In Proceedings of the 37th Annual ACM Symposium on Theory of Computing |
| Citations: | 113 - 22 self |
BibTeX
@INPROCEEDINGS{Arora05euclideandistortion,
author = {Sanjeev Arora and James R. Lee and Assaf Naor},
title = {Euclidean distortion and the Sparsest Cut},
booktitle = {In Proceedings of the 37th Annual ACM Symposium on Theory of Computing},
year = {2005},
pages = {553--562},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Bi-Lipschitz embeddings of finite metric spaces, a topic originally studied in geometric analysis and Banach space theory, became an integral part of theoretical computer science following work of Linial, London, and Rabinovich [29]. They presented an algorithmic version of a result of Bourgain [8] which shows that every
