Research map / Learning theory and algorithms / Submodular and game algorithms
Multi-objective Maximization of Monotone Submodular Functions with 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
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.92)
- Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time (NeurIPS 2019 · similarity 0.92)
- Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation (ICML 2025 · similarity 0.89)
- Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization (NeurIPS 2024 · similarity 0.89)
- A Unified Approach to Submodular Maximization Under Noise (NeurIPS 2025 · similarity 0.89)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.89)
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.