Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint

We study the problem of maximizing a monotone submodular function subject to a matroid constraint, and present for it a deterministic non-oblivious local search algorithm that has an approximation guarantee of 1-1/e-\epsilon (for any \epsilon > 0 ) and query complexity of \tilde{O}_{\epsilon}(nr)...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 700 - 712
Hlavní autori:	Buchbinder, Niv, Feldman, Moran
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 27.10.2024
Predmet:	Approximation algorithms Complexity theory Computer science deterministic algorithm fast algorithm matroid constraint Search problems submodular maximization
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!