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

Full description

Bibliographic Details

Published in:	The Journal of artificial intelligence research Vol. 74; pp. 661 - 690
Main Authors:	Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Reiffenhäuser, Rebecca
Format:	Journal Article
Language:	English
Published:	San Francisco AI Access Foundation 01.01.2022
Subjects:	Approximation Artificial intelligence Constraints Greedy algorithms Mathematical analysis Maximization Optimization
ISSN:	1076-9757, 1076-9757, 1943-5037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!