Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity

Submodular maximization is a classic algorithmic problem with multiple applications in data mining and machine learning; there, the growing need to deal with massive instances motivates the design of algorithms balancing the quality of the solution with applicability. For the latter, an important me...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1060; p. 115629
Main Authors:	Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Marchetti-Spaccamela, Alberto, Reiffenhäuser, Rebecca
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 18.01.2026
Subjects:	adaptive complexity knapsack submodular maximization knapsack adaptive complexity submodular maximization
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!