Author of the publication

A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.

, , , , , and . SODA, page 21-32. ACM/SIAM, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Light graphs with small routing cost., , and . Networks, 39 (3): 130-138 (2002)An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree., and . Inf. Process. Lett., 63 (5): 263-269 (1997)The summation and bottleneck minimization for single-step searching on weighted graphs., , and . Inf. Sci., 74 (1-2): 1-28 (1993)An efficient external sorting algorithm., , and . Inf. Process. Lett., 75 (4): 159-163 (2000)The Development of RFID in Healthcare in Taiwan., , and . ICEB, page 340-345. Academic Publishers/World Publishing Corporation, (2004)Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs., , and . Inf. Process. Lett., 99 (2): 64-67 (2006)Parallel branch-and-bound approach with MPI technology in inferring chemical compounds with path frequency., , , , and . GrC, page 733-738. IEEE Computer Society, (2009)An improved algorithm for the maximum agreement subtree problem., , , , and . Inf. Process. Lett., 94 (5): 211-216 (2005)Using Conflicts to Derive Efficient Algorithms on the Single-Channel Broadcast Communication Model., and . J. Inf. Sci. Eng., 8 (2): 187-206 (1992)Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment., , , , , , , , , and 1 other author(s). J. Bioinform. Comput. Biol., 1 (2): 267-288 (2003)