English

A Note On Deterministic Submodular Maximization With Bounded Curvature

Data Structures and Algorithms 2024-09-06 v1 Machine Learning

Abstract

We show that the recent breakthrough result of [Buchbinder and Feldman, FOCS'24] could further lead to a deterministic (1κf/eε)(1-\kappa_{f}/e-\varepsilon)-approximate algorithm for maximizing a submodular function with curvature κf\kappa_{f} under matroid constraint.

Keywords

Cite

@article{arxiv.2409.02943,
  title  = {A Note On Deterministic Submodular Maximization With Bounded Curvature},
  author = {Wenxin Li},
  journal= {arXiv preprint arXiv:2409.02943},
  year   = {2024}
}
R2 v1 2026-06-28T18:34:25.058Z