Work

Lower-Stretch Spanning Trees

Year: 2004

Type: preprint

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).

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.cs/0411064

Authors: Elkin, Michael, Emek, Yuval, Spielman, Daniel A., Teng, Shang-Hua

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2950128268

Cites: 15

Cited by:

Related to: 10