Author of the publication

Approximating Hexagonal Steiner Minimal Trees by Fast Optimal Layout of Minimum Spanning Trees.

, , and . ICCD, page 392-. IEEE Computer Society, (1999)

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

Reducing the Steiner problem in four uniform orientations., and . Networks, 35 (4): 287-301 (2000)3-Partitioning Problems for Maximizing the Minimum Load., , and . J. Comb. Optim., 6 (1): 67-80 (2002)Phylogenetic k-Root and Steiner k-Root., , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 539-551. Springer, (2000)Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations., and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 71-80. Springer, (1999)A linear time algorithm for computing hexagonal Steiner minimum trees for terminals on the boundary of a regular hexagon., and . ISCAS, page 196-199. IEEE, (2000)Approximation algorithms for NMR spectral peak assignment., , , , , , and . Theor. Comput. Sci., 299 (1-3): 211-229 (2003)Decision Tree Complexity of Graph Properties with Dimension at Most 5., and . J. Comput. Sci. Technol., 15 (5): 416-422 (2000)Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length., and . Inf. Process. Lett., 69 (2): 53-57 (1999)Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times., , and . Oper. Res. Lett., 22 (2-3): 75-81 (1998)The longest common subsequence problem for sequences with nested arc annotations., , , and . J. Comput. Syst. Sci., 65 (3): 465-480 (2002)