TY - JOUR
T1 - Balancing minimum spanning trees and shortest-path trees
JF - Algorithmica
Y1 - 1995
A1 - Khuller, Samir
A1 - Raghavachari,B.
A1 - Young,N.
AB - We give a simple algorithm to find a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous tradeoff: given the two trees and agamma>0, the algorithm returns a spanning tree in which the distance between any vertex and the root of the shortest-path tree is at most 1+radic2gamma times the shortest-path distance, and yet the total weight of the tree is at most 1+radic2/gamma times the weight of a minimum spanning tree. Our algorithm runs in linear time and obtains the best-possible tradeoff. It can be implemented on a CREW PRAM to run a logarithmic time using one processor per vertex.
VL - 14
CP - 4
M3 - 10.1007/BF01294129
ER -