atlas

Research map / Graph learning / Graph algorithms and clustering

Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback

AAAI 2021 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 5 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
Relate adaptive policies to non-adaptive policies using hybrid policies and a sublinear-in-n analysisInfluence maximization under full-adoption feedback · General influence graphsadaptivity gap upper bound: ⌈n^{1/3}⌉Helped
Use the refined hybrid-policy analysis for in-arborescencesInfluence maximization under full-adoption feedback · In-arborescencesadaptivity gap upper bound: \frac{2e}{e-1}\approx 3.16 -> \frac{2e^2}{e^{2}-1}\approx 2.31Helped
Use the degree-excess parameter α to bound the reached-set boundaryInfluence maximization under full-adoption feedback · α-bounded graphsadaptivity gap upper bound: \min\left\{k,\frac{\alpha}{k}+2+ \frac{1}{1-(1-1/k)^k}\right\}Helped
Exploit the path-or-cycle structure of 0-bounded graphsInfluence maximization under full-adoption feedback · 0-bounded graphsadaptivity gap upper bound: \frac{3e^3}{e^{3}-1}\approx 3.16Helped

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