( en | de | ru )

 

Disambiguation of "Wu, Bang Ye"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Ye Wu

Holger Bang

Renate Bang

Claudia Bang

Willi Bang

 

Other publications of authors with the same name

An improved parameterized algorithm for the p-cluster vertex deletion problem., and . J. Comb. Optim., 33 (2): 373-388 (2017)A 2-approximation algorithm for the clustered minimum routing cost tree problem., and . ICS, volume 274 of Frontiers in Artificial Intelligence and Applications, page 3-10. IOS Press, (2014)On the minimum routing cost clustered tree problem., and . J. Comb. Optim., 33 (3): 1106-1121 (2017)A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees., , , , , and . SODA, page 21-32. ACM/SIAM, (1998)Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions, and . CoRR, (2013)Parameterized algorithms for min-max 2-cluster editing., and . J. Comb. Optim., 34 (1): 47-63 (2017)On the intercluster distance of a tree metric.. Theor. Comput. Sci., 369 (1-3): 136-141 (2006)Approximation algorithms for the shortest total path length spanning tree problem., , and . Discret. Appl. Math., 105 (1-3): 273-289 (2000)A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees., , , , , and . SIAM J. Comput., 29 (3): 761-778 (1999)On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality., , , , , and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 152-163. (2017)