公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
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.; KUN-MA0 CHAO | SIAM Journal on Computing | | | |
1998 | Approximating Maximum Leaf Spanning Trees in Almost Linear Time | Lu, H.-I.; Ravi, R.; HSUEH-I LU | Journal of Algorithms | | | |
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 | | | |