Lower-Stretch Spanning Trees
  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). 
Michael Elkin, Yuval Emek, Daniel A. Spielman and Shang-Hua Teng