Dynamic algorithms for non-monotone submodular maximization
From MaRDI portal
Cites work
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- An analysis of approximations for maximizing submodular set functions—I
- Dynamic algorithms for matroid submodular maximization
- Maximizing Non-monotone Submodular Functions
- On the complexity of dynamic submodular maximization
This page was built for publication: Dynamic algorithms for non-monotone submodular maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899728)