Earned benefit maximization in social networks under budget constraint
作者：
Highlights：
• Earned Benefit Maximization Problem has been studied.
• An approximation algorithm has been Proposed for this problem.
• The algorithm has been improved by exploiting the submodularity property of the benefit function.
• For larger datasets, an efficient heuristic solution has been proposed.
• Extensive set of experiments have been conducted.
摘要
•Earned Benefit Maximization Problem has been studied.•An approximation algorithm has been Proposed for this problem.•The algorithm has been improved by exploiting the submodularity property of the benefit function.•For larger datasets, an efficient heuristic solution has been proposed.•Extensive set of experiments have been conducted.
论文关键词：Social network,Earned benefit,Target nodes,Greedy algorithm,Effective nodes
论文评审过程：Received 11 July 2020, Revised 19 October 2020, Accepted 16 November 2020, Available online 19 November 2020, Version of Record 10 February 2021.
论文官网地址：https://doi.org/10.1016/j.eswa.2020.114346
