AI Paper Atlas

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

Dynamic influence maximization

Binghui Peng

NeurIPS 2021 · Learning theory and algorithms › Submodular and game algorithms · approach: Submodular influence maximization · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use multiple optimal-value guesses and marginal-gain thresholds instead of waiting to identify the maximum marginal elementDynamic MAX-k coverage · Incremental dynamic MAX-k coverageapproximation ratio: $(1-1/e-\epsilon)$Improved
Allow fully dynamic updates rather than only insertionsDynamic DIM · Fully dynamic DIM, ICapproximation ratio: $2^{-(\log n)^{1-o(1)}}$ approximation is impossible unless amortized time is $n^{1-o(1)}$Hurt
Allow fully dynamic updates under LT with seeds restricted to a prescribed setDynamic DIM · Fully dynamic DIM, LT, prescribed seed setapproximation ratio: $2^{-(\log n)^{1-o(1)}}$ approximation is impossible unless amortized time is $n^{1-o(1)}$Hurt

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