Using petal-decompositions to build a low stretch spanning tree.

Ittai Abraham Ofer Neiman

Published in: STOC (2012)

Keyphrases

spanning tree
minimum spanning tree
minimum cost
minimum spanning trees
edge disjoint
minimum weight
undirected graph
weighted graph
bayesian networks
objective function
high dimensional
special case
minimum total cost