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

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 700 - 712
Main Authors:	Buchbinder, Niv, Feldman, Moran
Format:	Conference Proceeding
Language:	English
Published:	IEEE 27.10.2024
Subjects:	Approximation algorithms Complexity theory Computer science deterministic algorithm fast algorithm matroid constraint Search problems submodular maximization
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!