Author of the publication

A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation.

, and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 473-482. Springer, (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

A Fast Approximation Algorithm for TSP with Neighborhoods., and . Nord. J. Comput., 6 (4): 469- (1999)Algorithms for Minimum Length Partitions of Polygons., , and . BIT, 27 (4): 474-479 (1987)Efficiently Correcting Matrix Products., , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 53-64. Springer, (2014)Improved Parallel Sorting of Presorted Sequences., and . CONPAR, volume 634 of Lecture Notes in Computer Science, page 539-544. Springer, (1992)Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case., and . ICCI, volume 497 of Lecture Notes in Computer Science, page 139-148. Springer, (1991)Covering Polygons with Minimum Number of Rectangles., and . STACS, volume 166 of Lecture Notes in Computer Science, page 63-72. Springer, (1984)Covering a Set of Points with a Minimum Number of Lines., and . CIAC, volume 3998 of Lecture Notes in Computer Science, page 6-17. Springer, (2006)TSP with Neighborhoods of Varying Size., , , , , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 187-199. Springer, (2002)On Parallel Complexity of Planar Triangulations., , and . FSTTCS, volume 1026 of Lecture Notes in Computer Science, page 413-427. Springer, (1995)Close Approximation of Minimum Rectangular Coverings., and . FSTTCS, volume 1180 of Lecture Notes in Computer Science, page 135-146. Springer, (1996)