Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti Spaccamela, Rebecca Reiffenhäuser

Journal title: Proceedings of the 38th International Conference on Machine Learning (ICML 2021)

Journal number: 139

Journal publisher: Proceedings of Machine Learning Research (PMLR)

Published year: 2021

Published pages: 231-242

ISSN: 1938-7228