A Note On Deterministic Submodular Maximization With Bounded Curvature
Abstract
We show that the recent breakthrough result of [Buchbinder and Feldman, FOCS'24] could further lead to a deterministic (1-f/e-)-approximate algorithm for maximizing a submodular function with curvature f under matroid constraint.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.