Author of the publication

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics.

, , and . ISAAC, volume 149 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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)A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location., , and . CoRR, (2020)Online Algorithms for Multi-Level Aggregation., , , , , , , , , and . CoRR, (2015)Unbounded lower bound for k-server against weak adversaries., , , and . STOC, page 1165-1169. ACM, (2020)Dynamic Balanced Graph Partitioning., , , , and . SIAM J. Discret. Math., 34 (3): 1791-1812 (2020)Optimizing Reconfigurable Optical Datacenters: The Power of Randomization., , and . SC, page 83:1-83:11. ACM, (2023)Unbounded lower bound for k-server against weak adversaries., , , and . CoRR, (2019)Online Algorithms for Multilevel Aggregation., , , , , , , , , and . Oper. Res., 68 (1): 214-232 (2020)Online Facility Location with Linear Delay., , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 45:1-45:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)An Optimal Algorithm for Online Multiple Knapsack., , and . ICALP, volume 168 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)