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

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Chen, Yixin, Kuhnle, Alan
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 04.08.2023
Predmet:	Algorithms Constraints Maximization Optimization Queries
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!