No confident code implementation found for this paper.
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.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Fast algorithms for k-submodular maximization subject to a matroid constraint
Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
Maximization of Approximately Submodular Functions
Fully Dynamic Submodular Maximization over Matroids
Stronger Approximation Guarantees for Non-Monotone γ-Weakly DR-Submodular Maximization
Poisson Exchange Beyond Submodularity: Effective Approximation Algorithms for Offline and Online Subset Selection over Matroids
@article{li2024note,
title = {A Note On Deterministic Submodular Maximization With Bounded Curvature},
author = {Wenxin Li},
year = {2024},
eprint = {2409.02943},
archivePrefix = {arXiv},
url = {http://arxiv.org/abs/2409.02943v1}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/2409.02943)