Research map / Learning theory and algorithms / Submodular and game algorithms
Fast Decomposable Submodular Function Minimization using Constrained Total Variation
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
- Decomposable Submodular Function Minimization via Maximum Flow (ICML 2021 · similarity 0.92)
- Decomposable Submodular Function Minimization: Discrete and Continuous (NeurIPS 2017 · similarity 0.90)
- Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components (NeurIPS 2021 · similarity 0.90)
- Discrete and Continuous Difference of Submodular Minimization (ICML 2025 · similarity 0.89)
- Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems (NeurIPS 2025 · similarity 0.88)
- Consistent Submodular Maximization (ICML 2024 · 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.