A tight bound on approximating arbitrary metrics by tree metrics

Journal of Computer and System Sciences

Volumn 69, Issue 3 SPEC. ISS., 2004, Pages 485-497

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

^a KASETSART UNIVERSITY   (Thailand)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Embeddings; Metrics; Tree Metrics

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; HIERARCHICAL SYSTEMS; PROBABILITY; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; GRAPH SEPARATORS; LOGARITHMIC FACTORS; RECURSIONS;

TREES (MATHEMATICS);

EID: 4544291996     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.04.011     Document Type: Conference Paper

References (50)

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