Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Graph-Theoretic Game and its Application to the $k$-Server Problem
SIAM Journal on Computing
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Small distortion and volume preserving embeddings for planar and Euclidean metrics
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A polynomial time approximation scheme for minimum routing cost spanning trees
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Better algorithms for unfair metrical task systems and applications
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An approximation algorithm for the covering Steiner problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the metric labeling problem via a new linear programming formulation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Steiner points in tree metrics don't (really) help
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximating min-sum k-clustering in metric spaces
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive concurrent distributed queuing
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A lower bound on the distortion of embedding planar metrics into Euclidean space
Proceedings of the eighteenth annual symposium on Computational geometry
Lectures on Discrete Geometry
An improved approximation algorithm for the 0-extension problem
SODA '03 Proceedings of the fourteenth 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
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Topology Aggregation for Directed Graph
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Low dimensional embeddings of ultrametrics
European Journal of Combinatorics
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Dimension reduction for ultrametrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized k-server algorithms for growth-rate bounded graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating metrics by tree metrics
ACM SIGACT News
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Online hierarchical cooperative caching
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Journal of the ACM (JACM)
On non-uniform multicommodity buy-at-bulk network design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Euclidean distortion and the sparsest cut
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Network design for information networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized k-server algorithms for growth-rate bounded graphs
Journal of Algorithms
Fitting tree metrics: Hierarchical clustering and Phylogeny
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Local versus global properties of metric spaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved embeddings of graph metrics into random trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A near-tight approximation lower bound and algorithm for the kidnapped robot problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Randomized online algorithms for minimum metric bipartite matching
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Planning Tours of Robotic Arms among Partitioned Goals
International Journal of Robotics Research
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Assign ranges in general ad-hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
Probabilistic embeddings of bounded genus graphs into planar graphs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Local embeddings of metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
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
Embedding metric spaces in their intrinsic dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On clustering to minimize the sum of radii
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Randomized k-server on hierarchical binary trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximating k-hop minimum spanning trees in Euclidean metrics
Information Processing Letters
On Metric Clustering to Minimize the Sum of Radii
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Optimal Random Matchings on Trees and Applications
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, 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
On low dimensional local embeddings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Additive Spanners for Circle Graphs and Polygonal Graphs
Graph-Theoretic Concepts in Computer Science
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
Journal of Discrete Algorithms
On the geometry of graphs with a forbidden minor
Proceedings of the forty-first annual ACM symposium on Theory of computing
Information Processing Letters
Randomly removing g handles at once
Proceedings of the twenty-fifth annual symposium on Computational geometry
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Distributed resource management and matching in sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Streaming Embeddings with Slack
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Survey on Oblivious Routing Strategies
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Online and offline algorithms for the sorting buffers problem on the line metric
Journal of Discrete Algorithms
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
ACM Transactions on Algorithms (TALG)
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Collective additive tree spanners of homogeneously orderable graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
MAP estimation of semi-metric MRFs via hierarchical graph cuts
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Maintaining approximate minimum steiner tree and k-center for mobile agents in a sensor network
INFOCOM'10 Proceedings of the 29th conference on Information communications
Genus and the geometry of the cut graph
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A regularization approach to metrical task systems
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Spanners of bounded degree graphs
Information Processing Letters
Local Global Tradeoffs in Metric Embeddings
SIAM Journal on Computing
Metric labeling and semi-metric embedding for protein annotation prediction
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Resilient and low stretch routing through embedding into tree metrics
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Optimal lower bounds for universal and differentially private steiner trees and TSPs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
An exact algorithm for robust network design
INOC'11 Proceedings of the 5th international conference on Network optimization
Strict Cost Sharing Schemes for Steiner Forest
SIAM Journal on Computing
Optimal cost-sharing mechanisms for steiner forest problems
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Traffic-redundancy aware network design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online sorting buffers on line
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the hardness of embeddings between two finite metrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A new template for solving p-median problems for trees in sub-quadratic time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Where's the winner? max-finding and sorting with metric costs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Approximation algorithms for requirement cut on graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multicommodity facility location under group Steiner access cost
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Distance approximating trees: complexity and algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The polymatroid steiner problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms 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
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
On the efficiency of routing in sensor networks
Journal of Parallel and Distributed Computing
Collective additive tree spanners for circle graphs and polygonal graphs
Discrete Applied Mathematics
Algorithms for the universal and a priori TSP
Operations Research Letters
Approximating k-hop minimum-spanning trees
Operations Research Letters
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
Local Versus Global Properties of Metric Spaces
SIAM Journal on Computing
On Clustering to Minimize the Sum of Radii
SIAM Journal on Computing
Hardness and approximation of the asynchronous border minimization problem
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
The online metric matching problem for doubling metrics
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Watchman routes for lines and segments
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Optimal random matchings, tours, and spanning trees in hierarchically separated trees
Theoretical Computer Science
Hi-index | 0.00 |
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This improves upon the result of Bartal who gave a bound of O(log n log log n). Moreover, our result is existentially tight; there exist metric spaces where any tree embedding must have distortion Ω(log n)-distortion. This problem lies at the heart of numerous approximation and online algorithms including ones for group Steiner tree, metric labeling, buy-at-bulk network design and metrical task system. Our result improves the performance guarantees for all of these problems.