atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time

NeurIPS 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 11 citations (OpenAlex)

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 changedWhereMeasuredEffect
decrease epsilon from 0.2 to 0.02 (ablation)TwinGreedyFast · BA graph monitoring, h=5, k=50utility (x10^5): 0.145 -> 0.155Helped
decrease epsilon from 0.02 to 0.005 (ablation)TwinGreedyFast · BA graph monitoring, h=5utility: 0.155 -> 0.155 (k=50)No clear effect
TwinGreedyFast versus SampleGreedy, RRG and FantomTwinGreedyFast · social network monitoring and viral marketingrunning time and queriesHelped
TwinGreedyFast versus Fantom on solution qualityTwinGreedyFast · social network monitoring and viral marketingutilityHurt
TwinGreedyFast versus SampleGreedy and RRG on solution qualityTwinGreedyFast · viral marketing (Flixster, Epinions)utilityHelped
TwinGreedyFast versus all baselines on ER graphTwinGreedyFast · ER random graph monitoringutilityNo clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy