AAAAAA

   
Results: 1-7 |
Results: 7
Approximation algorithms for the shortest total path length spanning tree problem
Authors: Wu, BY Chao, KM Tang, CY
Citation: By. Wu et al., Approximation algorithms for the shortest total path length spanning tree problem, DISCR APP M, 105(1-3), 2000, pp. 273-289
Approximation algorithms for some optimum communication spanning tree problems
Authors: Wu, BY Chao, KM Tang, CY
Citation: By. Wu et al., Approximation algorithms for some optimum communication spanning tree problems, DISCR APP M, 102(3), 2000, pp. 245-266
A polynomial time approximation scheme for optimal product-requirement communication spanning trees
Authors: Wu, BY Chao, KM Tang, CY
Citation: By. Wu et al., A polynomial time approximation scheme for optimal product-requirement communication spanning trees, J ALGORITHM, 36(2), 2000, pp. 182-204
A polynomial-time approximation scheme for minimum routing cost spanning trees
Authors: Wu, BY Lancia, G Bafna, V Chao, KM Ravi, R Tang, CAY
Citation: By. Wu et al., A polynomial-time approximation scheme for minimum routing cost spanning trees, SIAM J COMP, 29(3), 2000, pp. 761-778
Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
Authors: Wu, BY Chao, KM Tang, CY
Citation: By. Wu et al., Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices, J COMB OPTI, 3(2-3), 1999, pp. 199-211
Calign: aligning sequences with restricted affine gap penalties
Authors: Chao, KM
Citation: Km. Chao, Calign: aligning sequences with restricted affine gap penalties, BIOINFORMAT, 15(4), 1999, pp. 298-304
An efficient algorithm for the length-constrained heaviest path problem ona tree
Authors: Wu, BY Chao, KM Tang, CY
Citation: By. Wu et al., An efficient algorithm for the length-constrained heaviest path problem ona tree, INF PROCESS, 69(2), 1999, pp. 63-67
Risultati: 1-7 |