Research map / Learning theory and algorithms / Submodular and game algorithms
Improved Dynamic Algorithm for Non-monotone Submodular Maximization under Cardinality Constraint
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.93)
- Improved Fully Dynamic Submodular Maximization Under Matroid Constraints (AAAI 2026 · similarity 0.93)
- Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization (AAAI 2021 · similarity 0.92)
- A Unified Approach to Submodular Maximization Under Noise (NeurIPS 2025 · similarity 0.92)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.90)
- Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation (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.