On bicriterion minimal spanning trees: An approximation.

Kim Allan Andersen Kurt Jörnsten Mikael Lind

Published in: Comput. Oper. Res. (1996)

Keyphrases

spanning tree
edge disjoint
minimum spanning tree
minimum cost
minimum spanning trees
closed form
approximation algorithms
weighted graph
undirected graph
error bounds
minimum total cost
root node
edge weights
queueing networks
depth first search
approximation error
np hard