Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

Constrained submodular maximization problems encompass a wide variety of applications, including personalized recommendation, team formation, and revenue maximization via viral marketing. The massive instances occurring in modern-day applications can render existing algorithms prohibitively slow. Mo...

Celý popis

Podrobná bibliografia

Vydané v:	The Journal of artificial intelligence research Ročník 74; s. 661 - 690
Hlavní autori:	Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Reiffenhäuser, Rebecca
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Francisco AI Access Foundation 01.01.2022
Predmet:	Approximation Artificial intelligence Constraints Greedy algorithms Mathematical analysis Maximization Optimization
ISSN:	1076-9757, 1076-9757, 1943-5037
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!