| 臺大學術典藏 |
2018-09-10T07:32:42Z |
Constructing light spanning trees with small routing cost
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:42Z |
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:42Z |
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 |
| 臺大學術典藏 |
2018-09-10T06:59:56Z |
Approximation algorithms for some optimum communication spanning tree problems
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:55Z |
Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:53Z |
The swap edges of a multiple-sources routing tree
|
Wu, B.Y.,; Hsiao, C.Y.,; Chao, K.-M.; KUN-MA0 CHAO; Wang, Tyng-Guey |
| 臺大學術典藏 |
2018-09-10T06:26:56Z |
On the uniform edge-partition of a tree
|
Wu, B.Y.; Wang, H.-L.; Ta Kuan, S.T.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:10:46Z |
Light Graphs with Small Routing Cost
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T03:28:00Z |
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 |
| 臺大學術典藏 |
2018-09-10T03:28:00Z |
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T03:27:59Z |
Approximation algorithms for the shortest total path length spanning tree problem
|
KUN-MA0 CHAO; Tang, C.Y.; Chao, K.-M.; Wu, B.Y. |
| 臺大學術典藏 |
2018-09-10T03:27:59Z |
Approximation algorithms for some optimum communication spanning tree problems
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 國立成功大學 |
2017 |
On the complexity of the star p-hub center problem with parameterized triangle inequality
|
Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R.;Lee, C.-W.;Wu, B.Y. |
| 國立臺灣科技大學 |
2009 |
Innovative design of cassegrain solar concentrator system for indoor illumination utilizing chromatic aberration to filter out ultraviolet and infrared in sunlight
|
Whang A.J.-W.; Chen Y.-Y.; Wu B.-Y. |
| 國立臺灣大學 |
2008 |
The Swap Edges of a Multiple-Sources Routing Tree
|
Wu, B.Y.,; Hsiao, C.Y.,; Chao, K.-M. |
| 國立臺灣大學 |
2007 |
A Linear Time Algorithm for the Backup 2-Center Problem on a Tree
|
Wang, H.-L.; Wu, B. Y.; Chao, K.-M. |
| 國立臺灣大學 |
2007 |
Optimum Communication Spanning Trees
|
Wu, B.Y.; Tang C.Y.; Chao, K.-M. |
| 國立臺灣大學 |
2004 |
On the Uniform Edge-Partition of a Tree
|
Wu, B. Y.; Wang H.-L.; Kuan S. T.; Chao, K.-M. |
| 國立臺灣大學 |
2004 |
Spanning Trees and Optimization Problems
|
Wu, B. Y.; Chao, K.-M. |
| 國立成功大學 |
2003-11 |
Non-isothermal flow of a polymeric fluid past a submerged circular cylinder
|
Wu, Gien-Huang; Wu, B. Y.; Ju, Shen-Haw; Wu, C. C. |
| 國立臺灣大學 |
2002-03 |
Light Graph with Small Routing Cost
|
Wu, B. Y.; Chao, K.-M.; Tang, C. Y. |
| 國立臺灣大學 |
2002 |
On the Optimum Requirement Graph Problem
|
Wu, B. Y.; Chao, K.-M.; Tang, C. Y. |
| 國立臺灣大學 |
2000-03 |
Approximation Algorithms for the Shortest Total Path Length Spanning Tree Problem
|
Wu, B. Y.; Chao, K.-M.; Tang, C. Y. |
| 國立臺灣大學 |
2000-03 |
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. |
| 國立臺灣大學 |
2000-03 |
Approximation Algorithms for some Optimum Communication Spanning Tree Problems
|
Wu, B. Y.; Chao, K.-M.; Tang, C. Y. |
