The complexity of minimizing certain cost metrics for k-source spanning trees.

Harold S. Connamacher Andrzej Proskurowski

Published in: Discret. Appl. Math. (2003)

Keyphrases

spanning tree
minimum cost
edge disjoint
lowest cost
minimum total cost
minimum spanning tree
np hard
minimum spanning trees
complexity measures
high cost
total cost
worst case
maintenance effort
computational complexity
optimal solution
depth first search
root node
data structure