A tight bound on approximating arbitrary metrics by tree metrics

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 448-455

  Fakcharoenphol, Jittat ^a   Rao, Satish ^a   Talwar, Kunal ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Embeddings; Metrics; Tree metrics

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING;

METRIC SPACES;

TREES (MATHEMATICS);

EID: 0038784603     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780606.780608     Document Type: Conference Paper

References (46)

1. N. Alon, R. M. Karp, D. Peleg, and D. West. A graph-theoretic game and its application to the k-server problem. SIAM Journal on Computing, 24(1):78-100, Feb. 1995.
2. A. Archer, K. Talwar, and E. Tardos. Personal Communication, 2003.
3. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301, 1998.
4. B. Awerbuch and Y. Azar. Buy-at-bulk network design. In 38th Annual Symposium on Foundations of Computer Science, pages 542-547, Miami Beach, Florida, 20-22 Oct. 1997.
5. B. Awerbuch and D. Peleg. Concurrent online tracking of mobile users. In SIGCOMM, pages 221-233, 1991.
6. B. Awerbuch and Y. Shavitt. Topology aggregation for directed graphs. In Proceedings of IEEE ISCC (Athens, Greece), pp. 47-52, 1998.
7. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In IEEE Symposium on Foundations of Computer Science, pages 184-193, 1996.
8. Y. Bartal. On approximating arbitrary metrics by tree metrics. In STOC, 1998.
9. Y. Bartal. A constant factor approximation for min sum clustering on HSTs. Personal Communication, 2003.
10. Y. Bartal, A. Blum, C. Burch, and A. Tomkins. A polylog(n)-competitive algorithm for metrical task systems. In Proceedings of the Twenty-Ninth Annual ACM. Symposium on Theory of Computing, pages 711-719, El Paso, Texas, 4-6 May 1997.
11. Y. Bartal, M. Charikar and R. Raz. Approximating min-sum k-clustering in metric spaces. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pages 11-20, Hersonissos, Crete, Greece 6-8 July 2001.
12. Y. Bartal and M. Mendel. Multi-embedding and path approximation of metric spaces. In Symposium on Discrete Algorithms, 2003.
13. Y. Bartal and A. Rosen. The distributed k-server problem-a competitive distributed translator for k-server algorithms. In IEEE Symposium on Foundations of Computer Science, pages 344-353, 1992.
14. J. Bourgain. On lipschitz embeddings of finite metric spaces in hilbert space. Israel Journal of Mathematics, 52(1-2):46-52, 1985.
15. G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 8-16, 2001.
16. M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median. In STOC, pages 114-123, 1998.
17. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. A. Plotkin. Approximating a finite metric by a small number of tree metrics. In IEEE Symposium on Foundations of Computer Science, pages 379-388, 1998.
18. 1. In SODA, 2003.
19. C. Chekuri, S. Khanna, J. Naor, and L. Zosin. Approximation algorithms for the metric labeling problem via a new linear programming formulation. In Symposium on Discrete Algorithms, pages 109-118, 2001.
20. G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics (extended abstract). In IEEE Symposium on Foundations of Computer Science, pages 62-71, 1995.
21. J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar. An improved approximation for the 0-extension problem. In Symposium on Discrete Algorithms, 2003.
22. A. Fiat and M. Mendel. Better algorithms for unfair metrical task systems and applications. In Proceedings of the 32nd STOC, pages 725-734, 2000.
23. U. Feige. Approximating the bandwidth via volume respecting embeddings (extended abstract). In ACM, editor, Proceedings of the thirtieth annual ACM STOC, pages 90-99, 1998.
24. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. Journal of Algorithms, 37, 2000.
25. A. Gupta. Steiner points in tree metrics don't (really) help. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 220-227. ACM Press, 2001.
26. 1-embeddings of graphs. In 40th FOCS, pages 399-408, 1999.
27. M. Herlihy, S. Tirthapura, and R. Wattenhofer. Competitive concurrent distributed queueing. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing 2001.
28. T. C. Hu. Optimum communication spanning trees. SIAM J. Computing, 3:188-195, 1974.
29. S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang. On the placement of internet instrumentation. In Proceedings of IEEE INFOCOM (Tel-Aviv, Israel), 2000.
30. R. Karp. A 2k-competitive algorithm for the circle. Manuscript, August 1989.
31. P. N. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In ACM Symposium on Theory of Computing, pages 682-690, 1993.
32. J. M. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields. In IEEE Symposium on Foundations of Computer Science, pages 14-23, 1999.
33. G. Konjevod and R. Ravi. An approximation algorithm for the covering steiner problem. Symposium on Discrete Algorithms, pp. 338-344, 2000.
34. G. Konjevod, R. Ravi, and F. Salman. On approximating planar metrics by tree metrics. IPL: Information Processing Letters, 80, 2001.
35. M. R. Korupolu, G. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms pp. 586-595, 1999.
36. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms. In IEEE Symposium on Foundations of Computer Science, pages 422-431, 1988.
37. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. COMBINAT: Combinatorica, 15, 1995.
38. J. Matousek. Lectures on discrete geometry. Springer, in press.
39. I. Newman and Y. Rabinovich. A lower bound on the distortion of embedding planar metrics into euclidean space. In Proceedings of the eighteenth annual symposium on Computational geometry, pages 94-96. ACM Press, 2002.
40. D. Peleg and E. Reshef. Deterministic polylog approximation for minimum communication spanning trees. Lecture Notes in Computer Science, 1443:670-681, 1998.
41. Y. Rabinovich and R. Raz. Lower bounds on the distortion of embedding finite metric spaces in graphs. GEOMETRY: Discrete & Computational Geometry, 19, 1998.
42. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37(2):130-143, Oct. 1988.
43. S. Rao. Small distortion and volume preserving embeddings for planar and euclidean metrics. In Proceedings of the fifteenth annual symposium on Computational geometry, pages 300-306. ACM Press, 1999.
44. Y. Shavitt Topology aggregation for networks with hierarchical structure: A practical approach. In Proceedings of 86th Annual Allerton Conference on Communication, Control, and Computing (Allerton Park, Illinois), 1998.
45. P. D. Seymour. Packing directed circuits fractionally. Combinatorica, 15(2):281-288, 1995.
46. B. Y. Wu, G. Lancia, V. Bafna, K. Chao, R. Ravi, and C. Y. Tang. A polynomial time approximation scheme for mimimum routing cost spanning trees. In ACM-SIAM Symposium on Discrete Algorithms, 1998.