Searching for "Approximating Metric Spaces by Tree Metrics." – sorted by Relevance.
-
On Approximating Planar Metrics by Tree Metrics
- I Abstract We connect the results of Bartal [4] on probabilistic approximation of metric spaces by tree
- Cited by 20 (3 self) – Add To MetaCart
-
The Finite Capacity Dial-A-Ride Problem
- . Using Bartal's recent results on the probabilistic approximation of metric spaces by tree metrics, we
- Cited by 13 (0 self) – Add To MetaCart
-
On Approximating Arbitrary Metrics by Tree Metrics
- probabilistic approximations of arbitrary metric spaces by \hierarchically wellseparated tree" metric spaces
- Cited by 181 (10 self) – Add To MetaCart
-
Probabilistic Approximation of Metric Spaces and its Algorithmic Applications
- metric space can be probabilistically-approximated by hierarchically well-separated trees (HST) with a
- Cited by 257 (21 self) – Add To MetaCart
-
Approximating Minimum Communication Cost Spanning Trees and Related Problems
- : : : : : : : : : : : : 10 1.3.2 Probabilistic Approximation of Metric Spaces : : : : : : : : : 11 1.3.3 Rounding via Trees
- Cited by 3 (0 self) – Add To MetaCart
-
Primal-dual approximation algorithms for metric facility location and k-median problems
- ) algorithm using a probabilistic approximation of metric spaces by tree metrics. After a slight improvement
- Cited by 239 (8 self) – Add To MetaCart
-
Hardness of Preemptive Finite Capacity Dial-a-Ride
- -approximation algorithm for trees. Using the results on probabilistic approximation of metric spaces by tree
- Cited by 1 (0 self) – Add To MetaCart
-
Competitive Concurrent Distributed Queuing
- use approximation of metric spaces by tree metrics [1, 2, 3] to choose a tree with an expected
- Cited by 7 (4 self) – Add To MetaCart

