• DocumentCode
    1595931
  • Title

    Nearly Tight Low Stretch Spanning Trees

  • Author

    Abraham, Ittai ; Bartal, Yair ; Neiman, Ofer

  • Author_Institution
    Sch. of Eng. & Comput. Sci., Hebrew Univ.
  • fYear
    2008
  • Firstpage
    781
  • Lastpage
    790
  • Abstract
    We prove that any graph G with n points has a distribution T over spanning trees such that for any edge (u, v) the expected stretch ET~T[dT(u, nu)/dG(u, nu)] is bounded by Otilde(log n). Our result is obtained via a new approach of building "highways" between portals and a new strong diameter probabilistic decomposition theorem.
  • Keywords
    computational complexity; trees (mathematics); graph; nearly tight low stretch spanning trees; portals; probabilistic decomposition theorem; Clustering algorithms; Computer science; Linear systems; Mathematics; Portals; Road transportation; Tree graphs; Upper bound; spanning tree low stretch;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2008. FOCS '08. IEEE 49th Annual IEEE Symposium on
  • Conference_Location
    Philadelphia, PA
  • ISSN
    0272-5428
  • Print_ISBN
    978-0-7695-3436-7
  • Type

    conf

  • DOI
    10.1109/FOCS.2008.62
  • Filename
    4691010
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1595931