Fully dynamic submodular maximization over matroids
From MaRDI portal
Cites work
- A threshold of ln n for approximating set cover
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Dynamic algorithms for matroid submodular maximization
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- scientific article; zbMATH DE number 3580314 (Why is no real title available?)
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- Maximizing a monotone submodular function subject to a matroid constraint
- On the complexity of dynamic submodular maximization
- Robust monotone submodular function maximization
- Streaming algorithms for submodular function maximization
- Streaming submodular maximization under matroid constraints
- Submodular maximization meets streaming: matchings, matroids, and more
- The one-way communication complexity of submodular maximization with applications to streaming and robustness
- Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
Cited in
(2)
This page was built for publication: Fully dynamic submodular maximization over matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023526)