On positive influence dominating sets in social networks
In this paper, we investigate the positive influence dominating set (PIDS) which has applications in social networks. We prove that PIDS is APX-hard and propose a greedy algorithm with an approximation ratio of H(delta) where H is the harmonic function and delta is the maximum vertex degree of the graph representing a social network. (C) 2009 Elsevier B.V. All rights reserved.
positive influence dominating set dominating set social networks apx-hard