@inproceedings{5a2f36f06a7f42618a402b03e03e0584,

title = "Using petal-decompositions to build a low stretch spanning tree",

abstract = "We prove that any graph G=(V,E) with n points and m edges has a spanning tree T such that Σ (u,v)ε E(G)d T(u,v) = O(m log n log log n). Moreover such a tree can be found in time O(m log n log log n). Our result is obtained using a new petal-decomposition approach which guarantees that the radius of each cluster in the tree is at most 4 times the radius of the induced subgraph of the cluster in the original graph.",

keywords = "distortion, embedding, low stretch spanning tree, metric spaces",

author = "Ittai Abraham and Ofer Neiman",

year = "2012",

month = jun,

day = "26",

doi = "https://doi.org/10.1145/2213977.2214015",

language = "American English",

isbn = "9781450312455",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

pages = "395--405",

booktitle = "STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing",

note = "44th Annual ACM Symposium on Theory of Computing, STOC '12 ; Conference date: 19-05-2012 Through 22-05-2012",

}