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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 1060; s. 115629
Hlavní autori: Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Marchetti-Spaccamela, Alberto, Reiffenhäuser, Rebecca
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 18.01.2026
Predmet:
adaptive complexity
knapsack
submodular maximization
knapsack
adaptive complexity
submodular maximization
ISSN:0304-3975
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 measure is the adaptive complexity, which captures the number of sequential rounds of parallel computation needed by an algorithm to terminate. In this work, we obtain the first constant factor approximation algorithm for non-monotone submodular maximization subject to a knapsack constraint with near-optimal O(log n) adaptive complexity. Low adaptivity by itself, however, is not enough: a crucial feature to account for is represented by the total number of function evaluations (or value queries). Our algorithm asks O˜(n2) value queries but can be modified to run with only O˜(n), while retaining a low adaptive complexity of O(log2n). Besides the above improvement in adaptivity, this is also the first combinatorial approach with sublinear adaptive complexity for the problem and yields algorithms comparable to the state-of-the-art even for the special cases of cardinality constraints or monotone objectives.
ISSN:0304-3975
DOI:10.1016/j.tcs.2025.115629