Dettaglio pubblicazione
2021, Proceedings of the 38th International Conference on Machine Learning, Pages 231-242 (volume: 139)
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity (04b Atto di convegno in volume)
Amanatidis Georgios, Fusco Federico, Lazos Filippos, Leonardi Stefano, Marchetti-Spaccamela Alberto, Rebecca Reiffenhäuser
Gruppo di ricerca: Algorithms and Data Science
keywords