Author of the publication

An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem.

, , and . CCCG, page 97-100. (2005)

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

Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems., , , , and . USENIX Annual Technical Conference, General Track, page 337-352. USENIX, (2005)An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem., , and . CCCG, page 97-100. (2005)Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time., and . J. Algorithms, 28 (1): 125-141 (1998)Approximating the Minimum-Cost Maximum Flow is P-Complete., and . Inf. Process. Lett., 42 (6): 315-319 (1992)On distributing symmetric streaming computations., , , , and . SODA, page 710-719. SIAM, (2008)An optimal online algorithm for packet scheduling with agreeable deadlines., , and . SODA, page 801-802. SIAM, (2005)On the existence of schedules that are near-optimal for both makespan and total weighted completion time., and . Oper. Res. Lett., 21 (3): 115-122 (1997)An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions., , and . Comput. Geom., 42 (5): 376-387 (2009)Introduction to Algorithms, Second Edition, , , and . The MIT Press and McGraw-Hill Book Company, (2001)Improved Algorithms for Bipartite Network Flow., , , and . SIAM J. Comput., 23 (5): 906-933 (1994)