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

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings / annual Symposium on Foundations of Computer Science s. 700 - 712
Hlavní autoři: Buchbinder, Niv, Feldman, Moran
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 27.10.2024
Témata:
Approximation algorithms
Complexity theory
Computer science
deterministic algorithm
fast algorithm
matroid constraint
Search problems
submodular maximization
ISSN:2575-8454
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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) , where n is the size of the ground set and r is the rank of the matroid. Our algorithm vastly improves over the previous state-of-the-art 0.5008-approximation deterministic algorithm, and in fact, shows that there is no separation between the approximation guarantees that can be obtained by deterministic and randomized algorithms for the problem considered. The query complexity of our algorithm can be improved to \tilde{O}_{\epsilon}(n+\hat{r}\sqrt{{n}}) using randomization, which is nearly-linear for r=O(\sqrt{n}) , and is always at least as good as the previous state-of-the-art algorithms.
ISSN:2575-8454
DOI:10.1109/FOCS61266.2024.00050