A Note On Deterministic Submodular Maximization With Bounded Curvature

We show that the recent breakthrough result of [Buchbinder and Feldman, FOCS’24] could further lead to a deterministic $(1-{\kappa }_f\mathrm{/}e-\epsilon )$-approximate algorithm for maximizing a submodular function with curvature ${\kappa }_f$ under matroid constraint.