Using petal-decompositions to build a low stretch spanning tree

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 395-405

  Abraham, Ittai ^a   Neiman, Ofer ^b  

^a MICROSOFT RESEARCH   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

distortion; embedding; low stretch spanning tree; metric spaces

Indexed keywords

EMBEDDING; GRAPH G; INDUCED SUBGRAPHS; LOW STRETCH; METRIC SPACES; SPANNING TREE;

DECOMPOSITION; DISTORTION (WAVES); PARALLEL ARCHITECTURES; TREES (MATHEMATICS);

COMPUTATION THEORY;

EID: 84862605700     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214015     Document Type: Conference Paper

References (21)

1. Ittai Abraham, Yair Bartal, and Ofer Neiman. Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07, pages 502-511, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
2. Ittai Abraham, Yair Bartal, and Ofer Neiman. Nearly tight low stretch spanning trees. In FOCS '08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pages 781-790, Washington, DC, USA, 2008. IEEE Computer Society.
3. Noga Alon, Richard M. Karp, David Peleg, and Douglas West. A graph-theoretic game and its application to the k-server problem. SIAM J. Comput., 24(1):78-100, 1995.
4. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 184-, Washington, DC, USA, 1996. IEEE Computer Society.
5. Yair Bartal. On approximating arbitrary metrices by tree metrics. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, STOC '98, pages 161-168, New York, NY, USA, 1998. ACM.
6. Yair Bartal. Graph decomposition lemmas and their role in metric embedding methods. In Susanne Albers and Tomasz Radzik, editors, ESA, volume 3221 of Lecture Notes in Computer Science, pages 89-97. Springer, 2004.
7. Mihai Bǎ;doiu, Piotr Indyk, and Anastasios Sidiropoulos. Approximation algorithms for embedding general metrics into trees. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07, pages 512-521, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
8. Moses Charikar, Chandra Chekuri, Ashish Goel, and Sudipto Guha. Rounding via trees: deterministic approximation algorithms for group steiner trees and k-median. In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 114-123, New York, NY, USA, 1998. ACM Press.
9. Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, and Yann Vaxés. Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs. In Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques, APPROX/RANDOM'10, pages 95-109, Berlin, Heidelberg, 2010. Springer-Verlag.
10. Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng. Electrical ows, laplacian systems, and faster approximation of maximum ow in undirected graphs. In Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pages 273-282, New York, NY, USA, 2011. ACM.
11. Michael Elkin, Yuval Emek, Daniel A. Spielman, and Shang-Hua Teng. Lower-stretch spanning trees. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 494-503, New York, NY, USA, 2005. ACM Press.
12. Yuval Emek and David Peleg. Approximating minimum max-stretch spanning trees on unweighted graphs. In Proceedings of the fifteenth annualACM-SIAM symposium on Discrete algorithms,SODA '04, pages 261-270, Philadelphia, PA, USA, 2004. Society for Industrial and Applied Mathematics.
13. Yuval Emek and David Peleg. A tight upper bound on the probabilistic embedding of series-parallel graphs. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, SODA '06, pages 1045-1053, New York, NY, USA, 2006. ACM.
14. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, STOC '03, pages 448-455, New York, NY, USA, 2003. ACM.
15. Ioannis Koutis, Gary L. Miller, and Richard Peng. Approaching optimality for solving sdd linear systems. In 51th Annual IEEE Symposium on Foundations of Computer Science, October 23-26, 2010, pages235-244, Las Vegas, Nevada, USA.
16. Ioannis Koutis, Gary L. Miller, and Richard Peng. A nearly O(mlog n) time solver for SDD linear systems. In 52th Annual IEEE Symposium on Foundations of Computer Science, 2011.
17. James B. Orlin, Kamesh Madduri, K. Subramani, and M. Williamson. A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. of Discrete Algorithms, 8:189-198,June 2010.
18. P. D. Seymour. Packing directed circuits fractionally. Combinatorica, 15(2):281-288, June 1995.
19. Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by effective resistances. In Proceedings of the 40th annual ACM symposium on Theory of computing, STOC '08, pages 563-568, New York, NY, USA, 2008. ACM.
20. Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, STOC '04, pages 81-90, New York, NY, USA, 2004. ACM.
21. Ittai Abraham, Yair Bartal, and Ofer Neiman. Advances in metric embedding theory. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, STOC '06, pages 271-286, New York, NY, USA, 2006. ACM.