公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2013 | A linear-time algorithm for finding an edge-partition with max-min ratio at most two | Chu, A.-C.; Wu, B.Y.; Chao, K.-M.; KUN-MA0 CHAO | Discrete Applied Mathematics | 3 | 2 | |
2000 | A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Journal of Algorithms | 22 | 17 | |
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 | | | |
2010 | A tight bound on the min-ratio edge-partitioning problem of a tree | Chu, A.-C.; Wu, B.Y.; Wang, H.-L.; Chao, K.-M.; KUN-MA0 CHAO | Discrete Applied Mathematics | 4 | 3 | |
1999 | An efficient algorithm for the length-constrained heaviest path problem on a tree | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Information Processing Letters | | | |
1998 | Approximation algorithms for some optimum communication spanning tree problems | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Lecture Notes in Computer Science | | | |
2000 | Approximation algorithms for some optimum communication spanning tree problems | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Discrete Applied Mathematics | | | |
2000 | Approximation algorithms for the shortest total path length spanning tree problem | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Discrete Applied Mathematics | | | |
1998 | Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Lecture Notes in Computer Science | | | |
1999 | Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Journal of Combinatorial Optimization | 23 | 19 | |
1999 | Constructing light spanning trees with small routing cost | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Lecture Notes in Computer Science | | | |
2002 | Light Graphs with Small Routing Cost | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Networks | 28 | 22 | |
2007 | Optimum Communication Spanning Trees | Wu, B.Y.; Tang C.Y.; Chao, K.-M. | Chapter 59 of the book “Handbook of Approximation Algorithms and Metaheuristics,” edited by Teofilo F. Gonzalez, Chapman & Hall/CRC Press | | | |
2007 | Optimum communication spanning trees | Wu, B.Y.; Tang, C.Y.; KUN-MA0 CHAO | Handbook of Approximation Algorithms and Metaheuristics | | | |
2008 | The swap edges of a multiple-sources routing tree | Wu, B.Y.; Hsiao, C.Y.; KUN-MAO CHAO | Algorithmica (New York) | 19 | 13 | |