On Minimum Diameter Spanning Trees under Reload Costs.

Hans-Christoph Wirth Jan Steffan

Published in: WG (1999)

Keyphrases

spanning tree
edge disjoint
minimum total cost
minimum cost
minimum spanning tree
lowest cost
total length
maximum distance
undirected graph
minimum spanning trees
edge weights
total cost
running times
data structure
leaf nodes
weighted graph
lower bound