The complexity of influence maximization problem in the deterministic linear threshold model

The influence maximization is an important problem in the field of social network. Informally it is to select few people to be activated in a social network such that their aggregated influence can make as many as possible people active. Kempe et al. gave a -approximation algorithm for this problem in the linear threshold model and the independent cascade model. In addition, Chen et al. proved that the exact computation of the influence given a seed set is #P-hard in the linear threshold model. Both of the two models are based on randomized propagation, however such information might be obtained by surveys and data mining techniques. This will make great difference on the complexity of the problem. In this note, we study the complexity of the influence maximization problem in deterministic linear threshold model. We show that in the deterministic linear threshold model, there is no n (1-epsilon) -factor polynomial time approximation for the problem unless P=NP. We also show that the exact computation of the influence given a seed set can be solved in polynomial time.