Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser. Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. In Marina Meila, Tong Zhang 0001, editors, Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event. Volume 139 of Proceedings of Machine Learning Research, pages 231-242, PMLR, 2021. [doi]
@inproceedings{AmanatidisFLLMR21,
title = {Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity},
author = {Georgios Amanatidis and Federico Fusco and Philip Lazos and Stefano Leonardi and Alberto Marchetti-Spaccamela and Rebecca Reiffenhäuser},
year = {2021},
url = {http://proceedings.mlr.press/v139/amanatidis21a.html},
researchr = {https://researchr.org/publication/AmanatidisFLLMR21},
cites = {0},
citedby = {0},
pages = {231-242},
booktitle = {Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event},
editor = {Marina Meila and Tong Zhang 0001},
volume = {139},
series = {Proceedings of Machine Learning Research},
publisher = {PMLR},
}