Complexity of network synchronization
Journal of the ACM (JACM)
A Graph-Theoretic Game and its Application to the $k$-Server Problem
SIAM Journal on Computing
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
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 polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
An approximation algorithm for the covering Steiner problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Deterministic Polylog Approximation for Minimum Communication Spanning Trees
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Finding effective support-tree preconditioners
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Improved embeddings of graph metrics into random trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A tight upper bound on the probabilistic embedding of series-parallel graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Probabilistic embeddings of bounded genus graphs into planar graphs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Strong-diameter decompositions of minor free graphs
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The zoo of tree spanner problems
Discrete Applied Mathematics
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Stochastic Steiner Tree with Non-uniform Inflation
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Maximum Gradient Embeddings and Monotone Clustering
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
Benchmarks for strictly fundamental cycle bases
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Subgraph sparsification and nearly optimal ultrasparsifiers
Proceedings of the forty-second ACM symposium on Theory of computing
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the approximability of the minimum strictly fundamental cycle basis problem
Discrete Applied Mathematics
The price of anarchy in cooperative network creation games
ACM SIGecom Exchanges
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A tight lower bound for the steiner point removal problem on trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Low distortion delaunay embedding of trees in hyperbolic plane
GD'11 Proceedings of the 19th international conference on Graph Drawing
Using petal-decompositions to build a low stretch spanning tree
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A fast solver for a class of linear systems
Communications of the ACM
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.02 |
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O (log2 n log log n). Moreover, we show that this tree can be constructed in time O (m log2n) in general, and in time O (mlog n) if the input graph is unweighted. The main ingredient in our construction is a novel graph decomposition technique.Our new algorithm can be immediately used to improve the running time of the recent solver for symmetric diagonally dominant linear systems of Spielman and Teng from m2(O√lognlog log n) to m log O(1)n and to O (n log2n log log n) when the system is planar. Our result can also be used to improve several earlier approximation algorithms that use low-stretch spanning trees.