Target users' activation probability maximization with different seed set constraints in social networks

DOI10.1016/j.tcs.2020.06.008zbMath1458.91176OpenAlexW3033749387MaRDI QIDQ2197539

Yuqing Zhu, Yongcai Wang, Yi Li, Ruidong Yan, Deying Li, Wenping Chen, Hongwei David Du

Publication date: 1 September 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.06.008

zbMATH Keywords

social networkseed selectiondouble greedy algorithminfluence decay modeltarget users

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Approximation algorithms (68W25)

Cites Work

• Ranking the spreading ability of nodes in complex networks based on local structure
• A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
• The Complexity of Enumeration and Reliability Problems
• An analysis of approximations for maximizing submodular set functions—I
• Reducibility among Combinatorial Problems

This page was built for publication: Target users' activation probability maximization with different seed set constraints in social networks