Issue Date | Title | Author(s) | Source | scopus | WOS | Fulltext/Archive link |
---|---|---|---|---|---|---|
1998 | Polynomial time approximation scheme for minimum routing cost spanning trees | Wu, Bang Ye; Lancia, Giuseppe; Bafna, Vineet; Chao, Kun-Mao; Ravi, R.; Tang, Chuan Yi; KUN-MA0 CHAO | Annual ACM-SIAM Symposium on Discrete Algorithms | |||
2000 | A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees | Wu, B. Y.; Lancia, G.; Bafna, V.; Chao, K.-M.; Ravi, R.; Tang, C. Y. | SIAM Journal on Computing |