Research map / Learning theory and algorithms / Submodular and game algorithms
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Corrected analysis of a polylogarithmic dynamic algorithm (sampling-based levels with reconstruction conditioned only on deletions to earlier levels) for cardinality-constrained monotone submodular maximization | dynamic submodular maximization under cardinality constraint k · theoretical analysis (no experiments reported) | approximation ratio | No clear effect |
Closest papers by meaning
- Learning-Augmented Dynamic Submodular Maximization (NeurIPS 2024 · similarity 0.92)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.91)
- Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint (NeurIPS 2024 · similarity 0.90)
- A Dynamic Algorithm for Weighted Submodular Cover Problem (ICML 2024 · similarity 0.89)
- Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation (ICML 2025 · similarity 0.88)
- A Near Linear Query Lower Bound for Submodular Maximization (ICML 2025 · similarity 0.88)
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.