Complexity of network synchronization
Journal of the ACM (JACM)
The Johnson-Lindenstrauss Lemma and the sphericity of some graphs
Journal of Combinatorial Theory Series A
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Small distortion and volume preserving embeddings for planar and Euclidean metrics
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Database-friendly random projections
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An elementary proof of a theorem of Johnson and Lindenstrauss
Random Structures & Algorithms
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the Impossibility of Dimension Reduction in \ell _1
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Approximation Algorithms for the 0-Extension Problem
SIAM Journal on Computing
Low-distortion embeddings of general metrics into the line
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast construction of nets in low dimensional metrics, and their applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Searching dynamic point sets in spaces with bounded doubling dimension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Embedding ultrametrics into low-dimensional spaces
Proceedings of the twenty-second annual symposium on Computational geometry
Cover trees for nearest neighbor
ICML '06 Proceedings of the 23rd international conference on Machine learning
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Nearest-neighbor-preserving embeddings
ACM Transactions on Algorithms (TALG)
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Proximity algorithms for nearly-doubling spaces
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain and of Johnson and Lindenstrauss imply that any metric on n points embeds into an O(log n)-dimensional Euclidean space with O(log n) distortion. Moreover, a simple "volume" argument shows that this bound is nearly tight: the uniform metric on n points requires Ω(log n/log log n) dimensions to embed with logarithmic distortion. It is natural to ask whether such a volume restriction is the only hurdle to low-dimensional low-distortion embeddings. Do doubling metrics, which do not have large uniform submetrics, embed in low dimensional Euclidean spaces with small distortion? In this paper, we answer the question positively and show that any doubling metric embeds into O(log log n) dimensions with o(log n) distortion. In fact, we give a suite of embeddings with a smooth trade-off between distortion and dimension: given an n-point metric (V,d) with doubling dimension dimD, and any target dimension T in the range Ω(dimD log log n) ≤ T ≤ O(log n), we embed the metric into Euclidean space ℝT with O(log n√dimD/T) distortion.