A Note On Deterministic Submodular Maximization With Bounded Curvature
arXiv:2409.02943
Abstract
We show that the recent breakthrough result of [Buchbinder and Feldman, FOCS'24] could further lead to a deterministic -approximate algorithm for maximizing a submodular function with curvature under matroid constraint.