Adaptivity gap for influence maximization with linear threshold model on trees

DOI10.1007/978-3-031-39344-0_12MaRDI QIDQ6535812zbMATH OpenFDO

Authors Yichen Tao, S. Wang, Kuan Yang

Publication date 28 February 2024

Full work available at URL https://doi.org/10.1007/978-3-031-39344-0_12

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Recommendations

• Adaptive influence maximization under fixed observation time-step
• Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
• Influence minimization in linear threshold networks
• The complexity of influence maximization problem in the deterministic linear threshold model
• Maximizing influence in a social network: improved results using a genetic algorithm

Cites work

• Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization
• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• An analysis of approximations for maximizing submodular set functions—I
• Automata, Languages and Programming
• Better bounds on the adaptivity gap of influence maximization under full-adoption feedback
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 7650257 (Why is no real title available?)
• Submodularity of influence in social networks: from local to global

Cited in

(1)

• Adaptive influence maximization under fixed observation time-step

This page was built for publication: Adaptivity gap for influence maximization with linear threshold model on trees

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