Title
Influence efficiency maximization: How can we spread information efficiently?
Abstract
•Propose a new problem influence efficiency maximization which take propagation time delay into consideration.•Prove the proposed problem is NP-hard and the computation of influence efficiency is #P-hard under independent cascade model.•Prove the influence efficiency function is submodular under independent cascade model.•Propose an efficient algorithm called RES to solve this problem.
Year
DOI
Venue
2018
10.1016/j.jocs.2017.11.001
Journal of Computational Science
Keywords
Field
DocType
Influence maximization,Information diffusion,Influence efficiency,Social network
Diffusion process,Mathematical optimization,Data set,Computer science,Submodular set function,Expected value,Cascade,Propagation time,Maximization,Computation
Journal
Volume
ISSN
Citations 
28
1877-7503
1
PageRank 
References 
Authors
0.34
11
5
Name
Order
Citations
PageRank
Xiang Zhu1242.66
Zhefeng Wang211.02
Yu Yang311914.30
Bin Zhou434130.99
Yan Jia552.79