Lower-stretch spanning trees

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 494-503

  Elkin, Michael ^a   Spielman, Daniel A ^b   Emek, Yuval ^c   Teng, Shang Hua ^d  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d BOSTON UNIVERSITY   (United States)

Author keywords

Low distortion embeddings; Low stretch spanning trees; Probabilistic tree metrics

Indexed keywords

APPROXIMATION ALGORITHMS; LOW-DISTORTION EMBEDDINGS; LOW-STRETCH SPANNING TREES; PROBABILISTIC TREE METRICS;

ALGORITHMS; APPROXIMATION THEORY; EMBEDDED SYSTEMS; GRAPH THEORY; LINEAR SYSTEMS;

TREES (MATHEMATICS);

EID: 32144444279     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060665     Document Type: Conference Paper

References (21)

1. Noga Alon, Richard M. Karp, David Peleg, and Douglas West. A graph-theoretic game and its application to the k-server problem. SIAM Journal on Computing, 24(1):78-100, February 1995.
2. Yonatan Aumann and Yuval Rabani. An o(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301, 1998.
3. B. Awerbuch and Y. Azar. Buy-at-bulk network design. In Proceedings of the 38th IEEE FOCS, pages 542-547, 1997.
4. Baruch Awerbuch. Complexity of network synchronization. J. ACM, 32(4):804-823, 1985.
5. Yair Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th IEEE FOCS, pages 184-193, 1996.
6. Yair Bartal. On approximating arbitrary motrices by tree metrics. In Proceedings of the 30th ACM STOC, pages 161-168, 1998.
7. Yair Bartal. Personal Communication, 2005.
8. Erik Boman and Bruce Hcndrickson. On spanning tree preconditioners. Manuscript, Sandia National Lab., 2001.
9. Erik Bonian, Bruce Hendrickson, and Stephen Vavasis. Solving elliptic finite element systems in near-linear time with support preconditioners. Manuscript, Sandia National Lab. and Cornell, http://arXiv.org/abs/cs/0407022.
10. P. Crescenzi and V. Kann. A compendium of NP-hard problems. Available online at http://www.nada.kth.se/theory/compencliuni, 1998.
11. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th ACM STOC, pages 448-455, 2003.
12. M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to Theory of NP-Completeness. 1979.
13. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. In Proceedings of the 9th ACM-SIAM SODA, pages 253-259, 1998.
14. T.C. Hu. Optimum communication spanning trees. SIAM Journal on Computing, pages 188-195, 1974.
15. G. Konjevod and R. Ravi. An approximation algorithm for the covering Steiner problem. In Proceedings of the 11th ACM-SIAM SODA, pages 338-344, 2000.
16. Tom Leighton and Satish Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
17. Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatonca, 15:215-245, 1995.
18. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. 2000. SIAM Philadelphia PA.
19. D. Peleg and E. Reshef. Deterministic polylogarithmic approximation for minimum communication spanning trees. In Proc. 25th International Colloq. on Automata, Languages and Programming, pages 670-681, 1998.
20. P. D. Seymour. Packing directed circuits fractionally. Combinatorial, 15(2):281-288, 1995.
21. Daniel A. Spielman and Shang-Hna Teng. Nearly-linear time algorithms for grapli partitioning, graph sparsification. and solving linear systems. In Proceedings of the 36th ACM STOC, pages 81-90, 2004.