Author of the publication

Additive Approximation Schemes for Load Balancing Problems.

, , , and . ICALP, volume 198 of LIPIcs, page 42:1-42:17. 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

Near-Linear Time Algorithm for n-fold ILPs via Color Coding., , and . ICALP, volume 132 of LIPIcs, page 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Load Balancing: The Long Road from Theory to Practice., , , and . ALENEX, page 104-116. SIAM, (2022)Learning Augmented Energy Minimization via Speed Scaling., , , and . NeurIPS, (2020)Better Trees for Santa Claus., and . STOC, page 1862-1875. ACM, (2023)Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time., , , , and . SODA, page 1666-1681. SIAM, (2021)Local Search Breaks 1.75 for Graph Balancing., and . ICALP, volume 132 of LIPIcs, page 74:1-74:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Online Bin Covering with Limited Migration., , , , , and . ESA, volume 144 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems., , and . CoRR, (2024)Load Balancing: The Long Road from Theory to Practice., , , and . CoRR, (2021)Santa Claus meets Makespan and Matroids: Algorithms and Reductions., , , , and . SODA, page 2829-2860. SIAM, (2024)