Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping

DOI10.4230/lipics.esa.2021.41arXiv2007.10470OpenAlexW3198320701MaRDI QIDQ6075930

Yaron Fairstein, Hadas Shachnai, Ariel Kulik

Publication date: 20 September 2023

Full work available at URL: https://arxiv.org/abs/2007.10470

zbMATH Keywords

randomized roundinglinear groupingmultiple knapsacksumodular optimizationmultiple choice multiple knapsack

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

An almost optimal approximation algorithm for monotone submodular multiple knapsack

This page was built for publication: Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping