Author of the publication

The Preemptive Resource Allocation Problem.

, , and . FSTTCS, volume 150 of LIPIcs, page 26:1-26:15. 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

Fast Information Spreading in Graphs with Large Weak Conductance., and . SIAM J. Comput., 41 (6): 1451-1465 (2012)Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs., and . FCT, volume 4639 of Lecture Notes in Computer Science, page 482-493. Springer, (2007)Throughput maximization of real-time scheduling with batching., , , , , and . ACM Trans. Algorithms, 5 (2): 18:1-18:17 (2009)Real-Time k-bounded Preemptive Scheduling., , , and . ALENEX, page 127-137. SIAM, (2016)Improved Approximation for Two-Dimensional Vector Multiple Knapsack., , and . ISAAC, volume 283 of LIPIcs, page 20:1-20:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)An EPTAS for Budgeted Matching and Budgeted Matroid Intersection., , and . CoRR, (2023)The Euclidean k-Supplier Problem., , and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 290-301. Springer, (2013)Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding., , and . FOCS, page 1366-1376. IEEE, (2023)Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping., , and . ESA, volume 204 of LIPIcs, page 41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Spatial Voting with Incomplete Voter Information., , , , and . AAAI, page 9790-9797. AAAI Press, (2024)