Author of the publication

Smoothed Analysis of the 2-Opt Algorithm for the General TSP.

, , and . ACM Trans. Algorithms, 13 (1): 10:1-10:15 (2016)

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

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP., , and . Algorithmica, 68 (1): 190-264 (2014)The Power of Reordering for Online Minimum Makespan Scheduling., , and . FOCS, page 603-612. IEEE Computer Society, (2008)Scheduling with a Reordering Buffer., and . Encyclopedia of Algorithms, (2016)Smoothed Analysis of the 2-Opt Algorithm for the General TSP., , and . ACM Trans. Algorithms, 13 (1): 10:1-10:15 (2016)Reordering Buffer Management for Non-uniform Cost Models., and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 627-638. Springer, (2005)Generalized Reordering Buffer Management., , , and . STACS, volume 25 of LIPIcs, page 87-98. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2014)Reordering buffers for general metric spaces., , and . STOC, page 556-564. ACM, (2007)An O(log k)-Competitive Algorithm for Generalized Caching., , , and . ACM Trans. Algorithms, 15 (1): 6:1-6:18 (2019)Online Packet Scheduling for CIOQ and Buffered Crossbar Switches., , and . Algorithmica, 80 (12): 3861-3888 (2018)Almost tight bounds for reordering buffer management., , , and . STOC, page 607-616. ACM, (2011)