The following publications are possibly variants of this publication:
- Approximation Algorithms for 2-Source Minimum Routing Cost ::::k:::: -Tree ProblemsYen Hung Chen, Gwo-Liang Liao, Chuan Yi Tang. iccsa 2007: 520-533 [doi]
- 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.
- Approximation algorithms for some ::::k::::-source shortest paths spanning tree problemsYen Hung Chen, Bang Ye Wu, Chuan Yi Tang. networks, 47(3):147-156, 2006. [doi]
- A polynomial time approximation scheme for the two-source minimum routing cost spanning treesBang Ye Wu. jal, 44(2):359-378, 2002. [doi]
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing ProblemZhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang. cocoa 2008: 286-295 [doi]