Abstract
We improve the result of [Bart96] on probabilistic approximation of metric spaces by `hierarchically well-separated tree' metric spaces. We obtain an approximation factor of O(log n log log n) getting the gap to the lower bound within lower order factors. We also give a deterministic version of the result which gives a tree with low average distortion of distances. The results have applications in a variety of areas including approximation algorithms, on-line algorithms and distributed computation and hence we obtain new approximation bounds for these applications.
| Original language | American English |
|---|---|
| Pages (from-to) | 161-168 |
| Number of pages | 8 |
| Journal | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |
| State | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA Duration: 23 May 1998 → 26 May 1998 |