Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence

Abstract

Influence maximization is an important problem in social networks. Bharathi et al. (Competitive influence maximization in social networks, pp 306---311, 2007) conjectured that this problem is $${{\mathcal {N}}}{{\mathcal {P}}}$$NP-hard on arborescence directed into a root. In this short note, we show that the conjecture is true for the independent cascade (IC) model, which is the most studied model in the literature specifying how each node influences other nodes. Therefore, assuming $${\mathcal {P}}\ne {{\mathcal {N}}}{{\mathcal {P}}}$$PźNP, there exists no polynomial-time algorithm for the influence maximization problem under the IC model on arborescence directed into a root. On the other hand, Wang et al. (J Comb Optim, doi:10.1007/s10878-016-9991-1, 2016) have shown that there exists polynomial-time algorithm for this problem under the linear threshold (LT) model. Hence, this pair of results is of theoretical interest since this is the first time to give a theoretical difference on computational complexity between the IC and LT models. We believe it may motivate further research for influence maximization on arborescence and other special graphs.