Approximating minimum bounded degree spanning trees to within one of optimal.

Mohit Singh Lap Chi Lau

Published in: STOC (2007)

Keyphrases

spanning tree
minimum cost
edge disjoint
minimum spanning trees
minimum spanning tree
total length
minimum total cost
special case
dynamic programming
optimal solution
np hard
bounded degree
databases
approximation algorithms
graph theoretic