Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Low Stretch Spanning Trees

  • Michael ElkinEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_215

Years and Authors of Summarized Original Work

  • 2005; Elkin, Emek, Spielman, Teng

Problem Definition

Consider a weighted connected multigraph G = ( V,  E,  ω), where ω is a function from the edge set E of G into the set of positive reals. For a path P in G, the weight of P is the sum of weights of edges that belong to the path P. For a pair of vertices u,  v ∈  V,the distance between them in G is the minimum weight of a path connecting u and v in G. For a spanning tree T of G, the stretch of an edge ( u, v) ∈  E is defined by
$$\displaystyle{ \mathrm{stretch}_{T}(u,v) = \frac{\mathrm{dist}_{T}(u,v)} {\mathrm{dist}_{G}(u,v)}, }$$

Keywords

Spanning trees with low average stretch 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Abraham I, Neiman O (2012) Using petal-decompositions to build low-stretch spanning trees. In: Proceedings of the 44th annual ACM symposium on theory of computing, New York, June 2012, pp 395–406Google Scholar
  2. 2.
    Abraham I, Bartal Y, Neiman O (2007) Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In: Proceedings of the 18th ACM-SIAM symposium on discrete algorithms, New Orleans, Jan 2007Google Scholar
  3. 3.
    Alon N, Karp RM, Peleg D, West D (1995) A graph-theoretic game and its application to the k-server problem. SIAM J Comput 24(1):78–100. Also available technical report TR-91-066, ICSI, Berkeley (1991)Google Scholar
  4. 4.
    Bartal Y (1996) Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th annual symposium on foundations of computer science, Berlington, Oct 1996, pp 184–193Google Scholar
  5. 5.
    Bartal Y (1998) On approximating arbitrary metrices by tree metrics. In: Proceedings of the 30th annual ACM symposium on theory of computing, Dallas, 23–26 May 1998, pp 161–168Google Scholar
  6. 6.
    Boman E, Hendrickson B (2001) On spanning tree preconditioners. Manuscript, Sandia National LabGoogle Scholar
  7. 7.
    Boman E, Hendrickson B, Vavasis S (2004) Solving elliptic finite element systems in near-linear time with suppost preconditioners. Manuscript, Sandia National Lab and Cornell. http://arXiv.org/abs/cs/0407022. Accessed 9 July 2004
  8. 8.
    Chekuri C, Hagiahayi MT, Kortsarz G, Salavatipour M (2006) Approximation algorithms for non-uniform buy-at-bulk network design. In: Proceedings of the 47th annual symposium on foundations of computer science, Berkeley, Oct 2006, pp 677–686Google Scholar
  9. 9.
    Deo N, Prabhu GM, Krishnamoorthy MS (1982) Algorithms for generating fundamental cycles in a graph. ACM Trans Math Softw 8:26–42MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Elkin M, Emek Y, Spielman D, Teng S-H (2005) Lower-stretch spanning trees. In: Proceedings of the 37th annual ACM symposium on theory of computing (STOC’05), Baltimore, May 2005, pp 494–503Google Scholar
  11. 11.
    Elkin M, Liebchen C, Rizzi R (2007) New length bounds for cycle bases. Inf Process Lett 104(5):186–193MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Emek Y, Peleg D (2006) A tight upper bound on the probabilistic embedding of series-parallel graphs. In: Proceedings of symposium on discrete algorithms (SODA’06), Miami, Jan 2006, pp 1045–1053Google Scholar
  13. 13.
    Fakcharoenphol J, Rao S, Talwar K (2003) A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the 35th annual ACM symposium on theory of computing, San Diego, June 2003, pp 448–455Google Scholar
  14. 14.
    Horton JD (1987) A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J Comput 16(2):358–366MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Spielman D, Teng S-H (2004) Nearly-linear time algorithm for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the 36th annual ACM symposium on theory of computing (STOC’04), Chicago, June 2004, pp 81–90Google Scholar
  16. 16.
    Stepanec GF (1964) Basis systems of vector cycles with extremal properties in graphs. Uspekhi Mat Nauk 19:171–175. (In Russian)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Zykov AA (1969) Theory of finite graphs. Nauka, Novosibirsk. (In Russian)zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceBen-Gurion UniversityBeer-ShevaIsrael