Nearly tight low stretch spanning trees

Ittai Abraham, Yair Bartal, Ofer Neiman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

67 Scopus citations

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[d T(u, v)/dG(u, v)] is bounded by Õ(log n). Our result is obtained via a new approach of building "highways" between portals and a new strong diameter probabilistic decomposition theorem.

Original languageEnglish
Title of host publicationProceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
Pages781-790
Number of pages10
DOIs
StatePublished - 30 Dec 2008
Externally publishedYes
Event49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 - Philadelphia, PA, United States
Duration: 25 Oct 200828 Oct 2008

Conference

Conference49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
Country/TerritoryUnited States
CityPhiladelphia, PA
Period25/10/0828/10/08

ASJC Scopus subject areas

  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Nearly tight low stretch spanning trees'. Together they form a unique fingerprint.

Cite this