Better bounds on the adaptivity gap of influence maximization under full-adoption feedback

DOI10.1016/j.artint.2023.103895arXiv2006.15374OpenAlexW3176276744MaRDI QIDQ6161475

Cosimo Vinci, Gianlorenzo D'Angelo, Debashmita Poddar

Publication date: 27 June 2023

Published in: Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithmsinfluence maximizationadaptive optimizationadaptivity gap

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
• Adaptive influence maximization under fixed observation time-step
• Emergence of Scaling in Random Networks
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Improved Approximation Algorithms for Stochastic Matching
• Approximating Matches Made in Heaven
• Markov Chains
• Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
• Algorithms and Adaptivity Gaps for Stochastic Probing
• Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions
• Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization
• Maximizing Social Influence in Nearly Optimal Time
• The Diffusion of Networking Technologies

This page was built for publication: Better bounds on the adaptivity gap of influence maximization under full-adoption feedback