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.
|Number of pages||14|
|State||Published - 2019|
|Event||30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States|
Duration: 6 Jan 2019 → 9 Jan 2019
|Conference||30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019|
|Period||6/01/19 → 9/01/19|
Bibliographical noteFunding Information:
Supported in part by ISF grant 1585/15 and BSF grant 2014414. Supported in part by ISF grant 1357/16. Supported by ISF grant 1357/16.
Copyright © 2019 by SIAM.
Copyright 2019 Elsevier B.V., All rights reserved.
- Deterministic algorithms
- Submodular optimization