Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization

DOI10.1613/JAIR.1.12997MaRDI QIDQ5094016zbMATH OpenOpenAlexFDO

Authors Wei Chen, Binghui Peng, Grant Schoenebeck, Biaoshuai Tao

Publication date 2 August 2022

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.08164

zbMATH Keywords

(adaptive) influence maximizationgreedy adaptivity gapgreedy algorithm

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Adaptive influence maximization under fixed observation time-step
• Fixed observation time-step: adaptive influence maximization
• Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
• Influence maximization with partial feedback
• Don’t Be Greedy: Leveraging Community Structure to Find High Quality Seed Sets for Influence Maximization

Cited in

(4)

• Adaptive influence maximization under fixed observation time-step
• Influence maximization with partial feedback
• Better bounds on the adaptivity gap of influence maximization under full-adoption feedback
• Adaptivity gap for influence maximization with linear threshold model on trees

This page was built for publication: Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094016)