Abstract
In social networks, the minimum positive influence dominating set (MPIDS) problem is NP-hard, which means it is unlikely to be solved precisely in polynomial time. For the purpose of efficiently solving this problem, greedy approximation algorithms seem appealing because they are fast and can provide guaranteed solutions. In this paper, based on the classic greedy algorithm for cardinality submodular cover, we propose a general greedy approximation algorithm (GGAA) for the MPIDS problem, which uses a generic real-valued submodular potential function, and enjoys a provable approximation guarantee under a wide condition. Two existing greedy algorithms, one of which is unknown for having an approximation ratio, both can be viewed as the specific versions of GGAA, and are shown to enjoy an approximation guarantee of the same order. Applying the framework of GGAA, we also design two new greedy approximation algorithms with fractional submodular potential functions. All these greedy algorithms are \(O(\ln \alpha )\)-approximations where \(\alpha \) is the maximum node degree of the network graph, while it is shown experimentally that these two new algorithms can yield better solutions on typical real social network instances. In this work, as a by-product, we achieve a new approximation ratio of the classic greedy algorithm for cardinality submodular cover, which slightly generalizes two existing results.
Similar content being viewed by others
References
Abu-Khzam FN, Lamaa K (2018) Efficient heuristic algorithms for positive-influence dominating set in social networks. In: INFOCOM2018. IEEE, pp 610–615
Daliri Khomami MM, Rezvanian A, Bagherpour N, Meybodi MR (2018) Minimum positive influence dominating set and its application in influence maximization: a learning automata approach. Appl Intell 48(3):570–593
Dinh TN, Shen Y, Nguyen DT, Thai MT (2014) On the approximability of positive influence dominating set in social networks. J Comb Optim 27(3):487–503
Du D-Z, Graham RL, Pardalos PM, Wan P-J, Wu W, Zhao W (2008) Analysis of greedy approximations with nonsubmodular potential functions. In: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA’08). ACM, pp 167–175
Du D-Z, Ko KI, Hu X (2011) Design and analysis of approximation algorithms. Springer
He J, Ji S, Beyah R, Cai Z (2014) Minimum-sized influential node set selection for social networks under the independent cascade model. In: Proceedings of the 15th ACM international symposium on mobile ad hoc networking and computing (MobiHoc ’14). ACM, pp 93–102
Lin G, Guan J, Feng H (2018) An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks. Physica A: Stat Mech Appl 500:199–209
Lin G, Luo J, Xu H, Xu M (2019) A hybrid swarm intelligence-based algorithm for finding minimum positive influence dominating sets. In: ICNC-FSKD 2019, in: advances in intelligent systems and computing, vol 1074. Springer, pp 506–511
McAuley J, Leskovec J (2012) Learning to discover social circles in ego networks. In: Proceedings of the 25th international conference on neural information processing systems (NIPS’12), vol 1. ACM, pp 539–547
Pan J, Bu T-M (2019) A fast greedy algorithm for finding minimum positive influence dominating sets in social networks. In: INFOCOM 2019. IEEE, pp 360–364
Raei H, Yazdani N, Asadpour M (2012) A new algorithm for positive influence dominating set in social networks. In: 2012 IEEE/ACM international conference on advances in social networks analysis and mining. IEEE, pp 253–257
Rozemberczki B, Davies R, Sarkar R, Sutton C.A (2019) GEMSEC: graph embedding with self clustering. In: International conference on advances in social networks analysis and mining (ASONAM’19). ACM, pp 65–72
Rozemberczki B, Allen C, Sarkar R (2019) Multi-scale attributed node embedding. CoRR arxiv:1909.13021
Rozemberczki B, Sarkar R (2020) Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models. CoRR arxiv:2005.07959
Wan P, Du D-Z, Pardalos PM, Wu W (2010) Greedy approximations for minimum submodular cover with submodular cost. Comput Optim Appl 45(2):463–474
Wang G Wang H, Tao X, Zhang J (2013) A self-stabilizing algorithm for finding a minimal positive influence dominating set in social networks. In: Proceedings of the twenty-fourth australasian database conference (ADC ’13), vol 137. ACM, pp 93–100
Wang F, Du H, Camacho E, Xu K, Lee W, Shi Y, Shan S (2011) On positive influence dominating sets in social networks. Theor Comput Sci 412(3):265–269
Wang F, Camacho E, Xu K (2009) Positive influence dominating set in online social networks. In: COCOA 2009, in: Lecture Notes in Computer Science, vol 5573. Springer, pp 313–321
Wang G, Wang H, Tao X, Zhang J (2011) Positive influence dominating set in e-learning social networks. In: ICWL 2011, in: Lecture Notes in Computer Science, vol 7048. Springer, pp 82–91
Wolsey LA (1982) An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4):385–393
Zhang W, Wu W, Wang F, Xu K (2012) Positive influence dominating sets in power-law graphs. Soc Netw Anal Mining 2(1):31–37
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Chen, W., Zhong, H., Wu, L. et al. A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks. J Comb Optim 44, 1–20 (2022). https://doi.org/10.1007/s10878-021-00812-3
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00812-3