Research map / Learning theory and algorithms / Submodular and game algorithms
Cardinality constrained submodular maximization for random streams
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 MonotoneStream instead of SieveStreaming or Salsa | Monotone submodular maximization · Frequent Itemset Mining and Steiner triple datasets | approximation ratio | Helped |
| Use MonotoneStream instead of offline LazyGreedy | Monotone submodular maximization · Frequent Itemset Mining and Steiner triple datasets | approximation ratio | No clear effect |
Closest papers by meaning
- Do Less, Get More: Streaming Submodular Maximization with Subsampling (NeurIPS 2018 · similarity 0.92)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.90)
- A Unified Approach to Submodular Maximization Under Noise (NeurIPS 2025 · similarity 0.90)
- Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint (NeurIPS 2024 · similarity 0.89)
- Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation (ICML 2025 · similarity 0.89)
- Online and Streaming Algorithms for Constrained k-Submodular Maximization (AAAI 2025 · 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.