( en | de | ru )

 

Disambiguation of "Wang, Biing-Feng"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient algorithms for two generalized 2-median problems and the group median problem on trees.

, , , and . Theor. Comput. Sci., 410 (8-10): 867-876 (2009)

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.

Feng Wang

Hui-Feng Wang

Ji-Feng Wang

Jun-Feng Wang

Yun-feng Wang

 

Other publications of authors with the same name

Improved data structures for the orthogonal range successor problem., , and . Comput. Geom., 44 (3): 148-159 (2011)Efficient algorithms for the inverse sorting problem with bound constraints under the l∞-norm and the Hamming distance., , , and . J. Comput. Syst. Sci., 75 (8): 451-464 (2009)Simulating the CRCW PRAM on Reconfigurable Networks.. Theor. Comput. Sci., 205 (1-2): 231-242 (1998)Efficient algorithms for two generalized 2-median problems and the group median problem on trees., , , and . Theor. Comput. Sci., 410 (8-10): 867-876 (2009)On Chen and Chen's new tree inclusion algorithm., and . Inf. Process. Lett., 103 (1): 14-18 (2007)Constant Time Algorithms for the Transitive Closure Problem and Its Applications., , and . ICPP (3), page 52-59. Pennsylvania State University Press, (1990)0-271-00728-1.Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence.. J. Algorithms, 23 (2): 329-344 (1997)A Better Analysis of Ben-Asher's Algorithm for the Conditional Cartesian Product Problem.. Parallel Process. Lett., 6 (3): 331-344 (1996)Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights., , and . Algorithmica, 56 (3): 297-312 (2010)Improved Algorithms for Finding Gene Teams and Constructing Gene Team Trees., and . IEEE ACM Trans. Comput. Biol. Bioinform., 8 (5): 1258-1272 (2011)