Lower-Stretch Spanning Trees
Elkin, Michael · Emek, Yuval · Spielman, Daniel A. · Teng, Shang-Hua
Original · EN
We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)²). Moreover, we show how to construct such a tree in time O(m log² n).
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.