Nearly tight low stretch spanning trees

Ittai Abraham; Yair Bartal; Ofer Neiman

doi:10.1109/FOCS.2008.62

Nearly tight low stretch spanning trees

Ittai Abraham, Yair Bartal, Ofer Neiman

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

68 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 E_T-T[d _T(u, v)/d_G(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 language	English
Title of host publication	Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
Pages	781-790
Number of pages	10
DOIs	https://doi.org/10.1109/FOCS.2008.62
State	Published - 30 Dec 2008
Externally published	Yes
Event	49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 - Philadelphia, PA, United States Duration: 25 Oct 2008 → 28 Oct 2008

Conference

Conference	49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
Country/Territory	United States
City	Philadelphia, PA
Period	25/10/08 → 28/10/08

ASJC Scopus subject areas

Computer Science (all)

Access to Document

10.1109/FOCS.2008.62

Cite this

@inproceedings{15be09dae2a946a681c4998b0b6ec541,

title = "Nearly tight low stretch spanning trees",

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 {\~O}(log n). Our result is obtained via a new approach of building {"}highways{"} between portals and a new strong diameter probabilistic decomposition theorem.",

author = "Ittai Abraham and Yair Bartal and Ofer Neiman",

year = "2008",

month = dec,

day = "30",

doi = "10.1109/FOCS.2008.62",

language = "English",

isbn = "9780769534367",

pages = "781--790",

booktitle = "Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008",

note = "49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 ; Conference date: 25-10-2008 Through 28-10-2008",

}

TY - GEN

T1 - Nearly tight low stretch spanning trees

AU - Abraham, Ittai

AU - Bartal, Yair

AU - Neiman, Ofer

PY - 2008/12/30

Y1 - 2008/12/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=57949097015&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2008.62

DO - 10.1109/FOCS.2008.62

M3 - Conference contribution

AN - SCOPUS:57949097015

SN - 9780769534367

SP - 781

EP - 790

BT - Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008

T2 - 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008

Y2 - 25 October 2008 through 28 October 2008

ER -

Nearly tight low stretch spanning trees

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this