Author of the publication

A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue.

, , , , , , and . Theor. Comput. Sci., (2013)

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)Online Algorithms for Multilevel Aggregation., , , , , , , , , and . Oper. Res., 68 (1): 214-232 (2020)Unbounded lower bound for k-server against weak adversaries., , , and . CoRR, (2019)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)An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem., , and . WAOA, volume 14297 of Lecture Notes in Computer Science, page 45-58. Springer, (2023)