( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Scheduling jobs with dwindling resource requirements in clouds.

, , и . INFOCOM, стр. 601-609. IEEE, (2014)

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.

Marie-Luisa Hadaschik

Edith Hadaschik

Boris Alexander Hadaschik

Kerstin Hadasch

Robert Peter Hadasch

 

Другие публикации лиц с тем же именем

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