A Graph-Theoretic Game and its Application to the $k$-Server Problem
SIAM Journal on Computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A polynomial time approximation scheme for minimum routing cost spanning trees
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multi-embedding and path approximation of metric spaces
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A tight bound on approximating arbitrary metrics by tree metrics
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
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Triangulation and Embedding Using Small Sets of Beacons
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Big-bang simulation for embedding network distances in Euclidean space
IEEE/ACM Transactions on Networking (TON)
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
SIAM Journal on Computing
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Local embeddings of metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Reconstructing approximate tree metrics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compact routing with slack in low doubling dimension
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Volume in general metric spaces
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
SIAM Journal on Discrete Mathematics
Using petal-decompositions to build a low stretch spanning tree
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
| Hi-index | 0.02 |
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a fundamental problem in network design. We present scaling distortion embeddings where the distortion scales as a function of ε, with the guarantee that for each ε the distortion of a fraction 1 - ε of all pairs is bounded accordingly. Such a bound implies, in particular, that the average distortion and lq-distortions are small. Specifically, our embeddings have constant average distortion and O(√log n) l2-distortion. This follows from the following results: we prove that any metric space embeds into an ultrametric with scaling distortion O(√1/ε). For the graph setting we prove that any weighted graph contains a spanning tree with scaling distortion O(√1/ε). These bounds are tight even for embedding in arbitrary trees. For probabilistic embedding into spanning trees we prove a scaling distortion of Õ(log2(1/ε)), which implies constant lq-distortion for every fixed q