Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time

In this work, we study the problem of finding the maximum value of a non-negative submodular function subject to a limit on the number of items selected, a ubiquitous problem that appears in many applications, such as data summarization and nonlinear regression. We provide the first deterministic, l...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Chen, Yixin, Kuhnle, Alan
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 04.08.2023
Subjects:	Algorithms Constraints Maximization Optimization Queries
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!