Research map / Learning theory and algorithms / Submodular and game algorithms
A General Framework for Dynamic Consistent 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
- Consistent Submodular Maximization (ICML 2024 · similarity 0.94)
- Improved Fully Dynamic Submodular Maximization Under Matroid Constraints (AAAI 2026 · similarity 0.93)
- Improved Dynamic Algorithm for Non-monotone Submodular Maximization under Cardinality Constraint (ICML 2026 · similarity 0.92)
- When Streaming Fails: Dynamic Algorithms for Unconstrained Submodular Maximization (NeurIPS 2026 · similarity 0.91)
- Learning-Augmented Dynamic Submodular Maximization (NeurIPS 2024 · similarity 0.91)
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · 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.