Using petal-decompositions to build a low stretch spanning tree

Ittai Abraham, Ofer Neiman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

55 Scopus citations

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.

Original languageEnglish
Title of host publicationSTOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing
Pages395-405
Number of pages11
DOIs
StatePublished - 26 Jun 2012
Event44th Annual ACM Symposium on Theory of Computing, STOC '12 - New York, NY, United States
Duration: 19 May 201222 May 2012

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference44th Annual ACM Symposium on Theory of Computing, STOC '12
Country/TerritoryUnited States
CityNew York, NY
Period19/05/1222/05/12

Keywords

  • distortion
  • embedding
  • low stretch spanning tree
  • metric spaces

Fingerprint

Dive into the research topics of 'Using petal-decompositions to build a low stretch spanning tree'. Together they form a unique fingerprint.

Cite this