From post

A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.

, , , , и . ESA, том 173 из LIPIcs, стр. 44:1-44:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

 

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

Invited Talks., , и . CIAC, том 12701 из Lecture Notes in Computer Science, стр. 3-19. Springer, (2021)Online Virtual Machine Allocation with Lifetime and Load Predictions., , , , и . SIGMETRICS (Abstracts), стр. 9-10. ACM, (2021)Non-preemptive buffer management for latency sensitive packets., и . J. Sched., 20 (4): 337-353 (2017)Offline and Online Algorithms for SSD Management., , и . SIGMETRICS (Abstracts), стр. 89-90. ACM, (2022)A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem., , , , и . ESA, том 173 из LIPIcs, стр. 44:1-44:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)General Knapsack Problems in a Dynamic Setting., , , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Timing Matters: Online Dynamics in Broadcast Games., , , , и . WINE, том 11316 из Lecture Notes in Computer Science, стр. 80-95. Springer, (2018)Online Semidefinite Programming., , и . ICALP, том 55 из LIPIcs, стр. 40:1-40:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Efficient Online Weighted Multi-Level Paging., , и . SPAA, стр. 94-104. ACM, (2021)Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification., , , , , и . ICALP, том 80 из LIPIcs, стр. 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)