Research map / Learning theory and algorithms / Submodular and game algorithms
Dynamic Submodular Maximization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Fully Dynamic Algorithm for Constrained Submodular Optimization (NeurIPS 2020 · similarity 0.94)
- Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time (ICML 2023 · similarity 0.94)
- Learning-Augmented Dynamic Submodular Maximization (NeurIPS 2024 · similarity 0.92)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.92)
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.91)
- Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint (NeurIPS 2024 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.