Research map / Learning theory and algorithms / Submodular and game algorithms
An Efficient Streaming Algorithm for the Submodular Cover Problem
Ashkan Norouzi-Fard, Abbas Bazzi, Ilija Bogunovic, Marwa El Halabi, Ya-Ping Hsieh, Volkan Cevher
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 single-pass ESC-Streaming with α = 2 instead of offline greedy | Active set selection on molecules · Active set selection, molecules | solution size ratio to offline greedy: largest ratio is 2.1089 | Mixed |
| Use ESC-Streaming with α = 2 instead of offline greedy | Active set selection on molecules · Active set selection, molecules | oracle calls relative to offline greedy: 3.15 % | Improved |
| Use ESC-Streaming with α = 2 instead of lazy greedy | Active set selection on molecules · Active set selection, molecules | oracle calls relative to lazy greedy: 25.5 % | Improved |
| Lower α from 2 to 1.1 (ablation) | ESC-Streaming · Active set selection, molecules | solution size | Improved |
| Lower α from 2 toward 1.1 (ablation) | ESC-Streaming · Active set selection, molecules | oracle calls | Hurt |
| Use ESC-Streaming instead of random selection | Graph cover · Vertex Cover and Dominating Set, uk-2014 | utility achieved for selected-set size | Improved |
| Use ESC-Streaming instead of offline greedy | Dominating Set · Dominating Set, Friendster | solution quality | No clear effect |
Closest papers by meaning
- Streaming Stochastic Submodular Maximization with On-Demand User Requests (NeurIPS 2025 · similarity 0.86)
- A Dynamic Algorithm for Weighted Submodular Cover Problem (ICML 2024 · similarity 0.86)
- Online and Streaming Algorithms for Constrained k-Submodular Maximization (AAAI 2025 · similarity 0.86)
- Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs (ICML 2024 · similarity 0.86)
- New Parallel and Streaming Algorithms for Directed Densest Subgraph (NeurIPS 2025 · similarity 0.86)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.85)
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.
