A polynomial time approximation scheme for minimum routing cost spanning trees (0)

by B Y Wu, G Lancia, V Bafna, K-M Chao, R Ravi, C Y Tang
Venue:SIAM J. Comput