An optimal synchronizer for the hypercube
SIAM Journal on Computing
Introduction to algorithms
On sparse spanners of weighted graphs
Discrete & Computational Geometry
NP-completeness of minimum spanner problems
Discrete Applied Mathematics
A Graph-Theoretic Game and its Application to the $k$-Server Problem
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Minimum Restricted Diameter Spanning Trees
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Tree Spanners in Planar Graphs
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
All pairs almost shortest paths
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Low Stretch Spanning Trees for Planar Graphs,
Low Stretch Spanning Trees for Planar Graphs,
Dynamic analysis of the arrow distributed protocol
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Low-distortion embeddings of general metrics into the line
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Embedding ultrametrics into low-dimensional spaces
Proceedings of the twenty-second annual symposium on Computational geometry
Approximation algorithms for embedding general metrics into trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The zoo of tree spanner problems
Discrete Applied Mathematics
Sparse geometric graphs with small dilation
Computational Geometry: Theory and Applications
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Spanners of bounded degree graphs
Information Processing Letters
Sparse geometric graphs with small dilation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Distance approximating trees: complexity and algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Max-stretch reduction for tree spanners
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Using petal-decompositions to build a low stretch spanning tree
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The problem of finding a tree t-spanner minimizing t is referred to as the Minimum Max-Stretch spanning Tree (MMST) problem. This paper concerns the MMST problem on unweighted graphs. The problem is known to be NP-hard, and the paper presents an O(log n) approximation algorithm for it.