Lower-Stretch Spanning Trees

Michael Elkin, Daniel A. Spielman, Shang-Hua Teng

Abstract: We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)^2). Moreover, we show how to construct such a tree in time O(m log^2 n).