Nearly Tight Low Stretch Spanning Trees

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

• Type: Conference
• Year: 2008
• Where: FOCS
• Authors: Ittai Abraham, Yair Bartal, Ofer Neiman
• Keywords: Diameter Probabilistic Decomposition, FOCS 2008, Stretch Et, Theoretical Computer Science