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

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!