On positive influence dominating sets with bi-directional weighted constraint in social networks
摘要
In this paper, we investigate the positive influence dominating set with bi-directional weighted constraint in social networks, which has practical applications in social networks. We prove that finding the minimum positive influence dominating sets with bi-directional weighted constraint is NP-hard in terms of computational complexity. We design an approximation algorithm for finding the minimum positive influence dominating sets with bi-directional weighted constraint and provide a theoretical analysis of the approximation ratio yielded by our proposed algorithm.