Author of the publication

Competitive Algorithms for the On-line Traveling Salesman.

, , , , and . WADS, volume 955 of Lecture Notes in Computer Science, page 206-217. Springer, (1995)

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

On-Line Dial-a-Ride Problems Under a Restricted Information Model., , , , and . Algorithmica, 40 (4): 319-329 (2004)A class of on-line scheduling algorithms to minimize total completion time., , and . Oper. Res. Lett., 31 (3): 232-236 (2003)The traveling salesman problem on cubic and subcubic graphs., , , and . Math. Program., 144 (1-2): 227-245 (2014)The traveling salesman problem on cubic and subcubic graphs, , , and . CoRR, (2011)Split Scheduling with Uniform Setup Times, , , , , and . CoRR, (2012)A Competitive Algorithm for the General 2-Server Problem., , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 624-636. Springer, (2003)On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems., , , , and . Algorithmica, 80 (11): 2993-3022 (2018)Scheduling Real-Time Mixed-Criticality Jobs., , , , , , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 90-101. Springer, (2010)The Online TSP Against Fair Adversaries., , , and . INFORMS J. Comput., 13 (2): 138-148 (2001)Strain-Aware Assembly of Genomes from Mixed Samples Using Flow Variation Graphs., , and . RECOMB, volume 12074 of Lecture Notes in Computer Science, page 221-222. Springer, (2020)