An optimal synchronizer for the hypercube
SIAM Journal on Computing
A Graph-Theoretic Game and its Application to the $k$-Server Problem
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Approximation algorithms for NP-hard problems
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of 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
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for some optimum communication spanning tree problems
Discrete Applied Mathematics
Approximation algorithms for the shortest total path length spanning tree problem
Discrete Applied Mathematics
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Approximating min-sum k-clustering in metric spaces
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A Variant of the Arrow Distributed Directory with Low Average Complexity
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Tree Spanners in Planar Graphs
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Deterministic Polylog Approximation for Minimum Communication Spanning Trees
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Divide-and-conquer approximation algorithms via spreading metrics
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th 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
FOCS '01 Proceedings of the 42nd IEEE 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
Low Stretch Spanning Trees for Planar Graphs,
Low Stretch Spanning Trees for Planar Graphs,
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Constructing light spanning trees with small routing cost
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Spanners of bounded degree graphs
Information Processing Letters
Journal of Computer and System Sciences
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
| Hi-index | 0.00 |
The paper provides a brief review of problems and results concerning low stretch and low communication spanning trees for graphs.