TY - CONF
T1 - Deterministic (1/2 + ε)-approximation for submodular maximization over a matroid
AU - Buchbinder, Niv
AU - Feldman, Moran
AU - Garg, Mohit
N1 - Publisher Copyright:
Copyright © 2019 by SIAM.
PY - 2019
Y1 - 2019
N2 - We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + ε)-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978.
AB - We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + ε)-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978.
KW - Deterministic algorithms
KW - Matroid
KW - Submodular optimization
UR - http://www.scopus.com/inward/record.url?scp=85065895374&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???
AN - SCOPUS:85065895374
SP - 241
EP - 254
T2 - 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
Y2 - 6 January 2019 through 9 January 2019
ER -