Dynamic algorithms for matroid submodular maximization
From MaRDI portal
Cited in
(8)- Subquadratic submodular maximization with a general matroid constraint
- Dynamic algorithms for non-monotone submodular maximization
- Dynamic algorithms for submodular maximization with a p-matchoid constraint
- Deletion robust non-monotone submodular maximization over matroids
- Fully dynamic submodular maximization over matroids
- Dynamic algorithms for maximizing a DR-submodular function subtracted by a linear function over the integer lattice
- Dynamic algorithms for submodular matching
- Dynamic DR-submodular maximization with linear costs over the integer lattice
This page was built for publication: Dynamic algorithms for matroid submodular maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645491)