Community-based acceptance probability maximization for target users on social networks (Q6073052)

This paper studies community-based acceptance probability maximization for target users on social networks. The acceptance probability maximization problem is proposed and is shown as a NP-hard problem. The objective function is shown to be submodular and monotone non-decreasing. Based on the community structure of social networks, the acceptance probability maximization is transformed to maximum weight hitting set problem. A pipage rounding algorithm is proposed for the acceptance probability maximization and the approximation ratio is \(1-e^{-1}\). Some simulation examples are provided. For the entire collection see [Zbl 1400.68037].