Author of the publication

Configuration Balancing for Stochastic Requests.

, , , , and . IPCO, volume 13904 of Lecture Notes in Computer Science, page 127-141. Springer, (2023)

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

Speed-Robust Scheduling - Sand, Bricks, and Rocks., , , , , and . IPCO, volume 12707 of Lecture Notes in Computer Science, page 283-296. Springer, (2021)Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time., , , , and . FSTTCS, volume 213 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Speed-Robust Scheduling., , , , , and . CoRR, (2020)Speed-robust scheduling: sand, bricks, and rocks., , , , , and . Math. Program., 197 (2): 1009-1048 (February 2023)Configuration Balancing for Stochastic Requests., , , , and . IPCO, volume 13904 of Lecture Notes in Computer Science, page 127-141. Springer, (2023)Configuration Balancing for Stochastic Requests., , , , and . CoRR, (2022)O(1/ε) Is the Answer in Online Weighted Throughput Maximization.. STACS, volume 289 of LIPIcs, page 32:1-32:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Optimally handling commitment issues in online throughput maximization.. ISAIM, (2022)O(1/ε) is the answer in online weighted throughput maximization.. CoRR, (2023)A general framework for handling commitment in online throughput maximization., , , , and . Math. Program., 183 (1): 215-247 (2020)