Positive Influence Dominating Set Generation via a New Greedy Algorithm

Current algorithms in the Positive Influence Dominating Set (PIDS) problem domain are focused on a specific type of PIDS, the Total Positive Influence Dominating Set (TPIDS). We have developed an algorithm specifically targeted towards the non-total type of PIDS. In addition to our new algorithm, we adapted two existing TPIDS algorithms to generate PIDS. We ran simulations for all three algorithms, and our new algorithm consistently generates smaller PIDS than either existing algorithm, with our algorithm generating PIDS approximately 5% smaller than the better of the two existing algorithms.

[1]  Aravind Srinivasan,et al.  Structural and algorithmic aspects of massive social networks , 2004, SODA '04.

[2]  My T. Thai,et al.  On the approximability of positive influence dominating set in social networks , 2014, J. Comb. Optim..

[3]  Nasser Yazdani,et al.  A New Algorithm for Positive Influence Dominating Set in Social Networks , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[4]  Kuai Xu,et al.  Positive Influence Dominating Set in Online Social Networks , 2009, COCOA.

[5]  Yan Shi,et al.  On positive influence dominating sets in social networks , 2011, Theor. Comput. Sci..