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

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Reiffenhäuser, Rebecca
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 23.10.2023
Subjects:	Algorithms Approximation Constraints Greedy algorithms Mathematical analysis Maximization Optimization
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!