A polynomial time approximation scheme for the two-source minimum routing cost spanning trees

Bang Ye Wu. A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. J. Algorithms, 44(2):359-378, 2002. [doi]

Abstract

Abstract is missing.