Author of the publication

General Knapsack Problems in a Dynamic Setting.

, , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 15:1-15:18. 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

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)Dynamicity and Multi-Commodity in Networks.. Technion - Israel Institute of Technology, Israel, (2022)Extremely efficient online query encoding for dense retrieval., , and . NAACL-HLT (Findings), page 43-50. Association for Computational Linguistics, (2024)Online Virtual Machine Allocation with Lifetime and Load Predictions., , , , and . SIGMETRICS (Abstracts), page 9-10. ACM, (2021)External Evaluation of Ranking Models under Extreme Position-Bias., , , and . WSDM, page 252-261. ACM, (2022)Evaluating D-MERIT of Partial-annotation on Information Retrieval., , , , , , and . CoRR, (2024)NFV Placement in Resource-Scarce Edge Nodes., , , and . CCGRID, page 51-60. IEEE, (2020)Algorithms for Dynamic NFV Workload., , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 238-258. Springer, (2018)General Knapsack Problems in a Dynamic Setting., , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem., , , , and . ESA, volume 173 of LIPIcs, page 44:1-44:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)