The following publications are possibly variants of this publication:
- A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning TreesBang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang. soda 1998: 21-32
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning TreesBang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang. SICOMP, 29(3):761-778, 1999.
- A polynomial time approximation scheme for the two-source minimum routing cost spanning treesBang Ye Wu. jal, 44(2):359-378, 2002. [doi]
- Optimum Communication Spanning TreesBang Ye Wu, Chuan Yi Tang, Kun-Mao Chao. In Teofilo F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications. Chapman and Hall/CRC, 2018.