%0 Journal Article %J Algorithmica %D 1995 %T Balancing minimum spanning trees and shortest-path trees %A Khuller, Samir %A Raghavachari,B. %A Young,N. %X 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. %B Algorithmica %V 14 %P 305 - 321 %8 1995/// %G eng %N 4 %R 10.1007/BF01294129