Research map / Learning theory and algorithms / Submodular and game algorithms
Fully Dynamic Algorithm for Constrained Submodular Optimization
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
- Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time (ICML 2023 · similarity 0.94)
- Dynamic Submodular Maximization (NeurIPS 2020 · similarity 0.94)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.93)
- Fully Dynamic Submodular Maximization over Matroids (ICML 2023 · similarity 0.93)
- Dynamic Non-monotone Submodular Maximization (NeurIPS 2023 · similarity 0.93)
- Learning-Augmented Dynamic Submodular Maximization (NeurIPS 2024 · similarity 0.92)
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.