2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32446We 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).Data Structures and AlgorithmsDiscrete MathematicsF.2.2; G.2.2text