TY - GEN
T1 - Nearly tight low stretch spanning trees
AU - Abraham, Ittai
AU - Bartal, Yair
AU - Neiman, Ofer
PY - 2008
Y1 - 2008
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 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:57949097015
SN - 9780769534367
T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
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 -