Information coverage maximization for multiple products in social networks (Q2182654)

The authors propose an information coverage maximization problem for multiple products in social networks. They choose nodes as seeds to propagate $k$ kinds of products information to maximize their information coverage. The problem is formulated as a $k$-submodular function, selecting $k$ disjoint sets as a cardinality constraint. The results include two algorithms with total size constraint and individual size constraint conditions. Experiments on real-world social networks illustrate the empirical advantages of the proposed strategy. Applications to influence and viral marketing motivate this work.