Research map / Learning theory and algorithms / Submodular and game algorithms
On Multiset Selection With Size Constraints
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 |
|---|---|---|---|
| use POMS (Pareto optimization) instead of Greedy and G-Greedy | Greedy / G-Greedy · Generalized influence maximization (ego-Facebook, Weibo) | expected activated nodes | Helped |
| use POMS instead of G-Greedy | G-Greedy · Budget allocation (Yahoo! data) | expected activated targets | No clear effect |
| use POMS instead of Greedy | Greedy · Budget allocation with a competitor (Yahoo! data) | expected activated targets | Helped |
| run POMS for far fewer iterations than worst-case bound (ablation) | POMS · Generalized influence maximization, k=7 | objective vs runtime: worst-case 190kn | Helped |
Closest papers by meaning
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.89)
- Robust Budget Allocation via Continuous Submodular Functions (ICML 2017 · similarity 0.89)
- Pareto Optimization for Subset Selection with Dynamic Cost Constraints (AAAI 2019 · similarity 0.88)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.87)
- Online and Streaming Algorithms for Constrained k-Submodular Maximization (AAAI 2025 · similarity 0.87)
- Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint (NeurIPS 2024 · similarity 0.86)
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.