A Note On Deterministic Submodular Maximization With Bounded Curvature
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912015215230976 |
|---|---|
| author | Li, Wenxin |
| author_facet | Li, Wenxin |
| contents | We show that the recent breakthrough result of [Buchbinder and Feldman, FOCS'24] could further lead to a deterministic $(1-κ_{f}/e-\varepsilon)$-approximate algorithm for maximizing a submodular function with curvature $κ_{f}$ under matroid constraint. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_02943 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Note On Deterministic Submodular Maximization With Bounded Curvature Li, Wenxin Data Structures and Algorithms Machine Learning We show that the recent breakthrough result of [Buchbinder and Feldman, FOCS'24] could further lead to a deterministic $(1-κ_{f}/e-\varepsilon)$-approximate algorithm for maximizing a submodular function with curvature $κ_{f}$ under matroid constraint. |
| title | A Note On Deterministic Submodular Maximization With Bounded Curvature |
| topic | Data Structures and Algorithms Machine Learning |
| url | https://arxiv.org/abs/2409.02943 |