@article {15217,
	title = {Balancing minimum spanning trees and shortest-path trees},
	journal = {Algorithmica},
	volume = {14},
	year = {1995},
	month = {1995///},
	pages = {305 - 321},
	abstract = {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.},
	doi = {10.1007/BF01294129},
	author = {Khuller, Samir and Raghavachari,B. and Young,N.}
}
