Lower-Stretch Spanning Trees

Simple item page
dc.creatorElkin, Michael
dc.creatorEmek, Yuval
dc.creatorSpielman, Daniel A.
dc.creatorTeng, Shang-Hua
dc.date2004-11-17
dc.date2005-05-13
dc.date.accessioned2026-07-07T03:22:03Z
dc.date.available2026-07-07T03:22:03Z
dc.descriptionWe 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).
dc.identifierhttps://arxiv.org/abs/cs/0411064
dc.identifierhttp://arxiv.org/abs/cs/0411064
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32446
dc.subjectData Structures and Algorithms
dc.subjectDiscrete Mathematics
dc.subjectF.2.2; G.2.2
dc.titleLower-Stretch Spanning Trees
dc.typetext

Files

Collections

arXiv