Author of the publication

Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times.

, , and . ICALP, volume 198 of LIPIcs, page 28:1-28:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Better Bounds for Online Line Chasing., , , , , and . CoRR, (2018)Unbounded lower bound for k-server against weak adversaries., , , and . STOC, page 1165-1169. ACM, (2020)Online Disjoint Set Covers: Randomization is not Necessary., , and . CoRR, (2024)Optimizing Reconfigurable Optical Datacenters: The Power of Randomization., , and . SC, page 83:1-83:11. ACM, (2023)Improved Analysis of Online Balanced Clustering., , , , , and . WAOA, volume 12982 of Lecture Notes in Computer Science, page 224-233. Springer, (2021)Better Bounds for Online Line Chasing., , , , , and . MFCS, volume 138 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Improved Online Algorithm for the Traveling Repairperson Problem on a Line., and . MFCS, volume 138 of LIPIcs, page 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Learning Minimum Linear Arrangement of Cliques and Lines., , , , and . ICDCS, page 175-185. IEEE, (2024)An Improved Algorithm For Online Reranking., and . CoRR, (2022)Migrating and replicating data in networks.. Comput. Sci. Res. Dev., 27 (3): 169-179 (2012)