Login / Signup
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.
José R. Correa
Cristina G. Fernandes
Martín Matamala
Yoshiko Wakabayashi
Published in:
WAOA (2007)
Keyphrases
</>
spanning tree
edge disjoint
minimum spanning tree
minimum cost
minimum spanning trees
undirected graph
minimum total cost
approximation algorithms
minimum weight
weighted graph
edge weights
total length
special case
markov chain
root node