{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T00:13:50Z","timestamp":1775607230941,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T00:00:00Z","timestamp":1633478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T00:00:00Z","timestamp":1633478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00812-3","type":"journal-article","created":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T10:48:33Z","timestamp":1633517313000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks"],"prefix":"10.1007","volume":"44","author":[{"given":"Weidong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Hao","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,6]]},"reference":[{"key":"812_CR1","doi-asserted-by":"crossref","unstructured":"Abu-Khzam FN, Lamaa K (2018) Efficient heuristic algorithms for positive-influence dominating set in social networks. In: INFOCOM2018. IEEE, pp 610\u2013615","DOI":"10.1109\/INFCOMW.2018.8406851"},{"issue":"3","key":"812_CR2","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/s10489-017-0987-z","volume":"48","author":"MM Daliri Khomami","year":"2018","unstructured":"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\u2013593","journal-title":"Appl Intell"},{"issue":"3","key":"812_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10878-012-9530-7","volume":"27","author":"TN Dinh","year":"2014","unstructured":"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\u2013503","journal-title":"J Comb Optim"},{"key":"812_CR4","unstructured":"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\u201908). ACM, pp 167\u2013175"},{"key":"812_CR5","doi-asserted-by":"crossref","unstructured":"Du D-Z, Ko KI, Hu X (2011) Design and analysis of approximation algorithms. Springer","DOI":"10.1007\/978-1-4614-1701-9"},{"key":"812_CR6","doi-asserted-by":"crossref","unstructured":"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 \u201914). ACM, pp 93\u2013102","DOI":"10.1145\/2632951.2632975"},{"key":"812_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.physa.2018.02.119","volume":"500","author":"G Lin","year":"2018","unstructured":"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\u2013209","journal-title":"Physica A: Stat Mech Appl"},{"key":"812_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013511","DOI":"10.1007\/978-3-030-32456-8_55"},{"key":"812_CR9","unstructured":"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\u201912), vol 1. ACM, pp 539\u2013547"},{"key":"812_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013364","DOI":"10.1109\/INFCOMW.2019.8845129"},{"key":"812_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013257","DOI":"10.1109\/ASONAM.2012.51"},{"key":"812_CR12","doi-asserted-by":"crossref","unstructured":"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\u201919). ACM, pp 65\u201372","DOI":"10.1145\/3341161.3342890"},{"key":"812_CR13","unstructured":"Rozemberczki B, Allen C, Sarkar R (2019) Multi-scale attributed node embedding. CoRR arxiv:1909.13021"},{"key":"812_CR14","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Sarkar R (2020) Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models. CoRR arxiv:2005.07959","DOI":"10.1145\/3340531.3411866"},{"issue":"2","key":"812_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10589-009-9269-y","volume":"45","author":"P Wan","year":"2010","unstructured":"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\u2013474","journal-title":"Comput Optim Appl"},{"key":"812_CR16","unstructured":"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 \u201913), vol 137. ACM, pp 93\u2013100"},{"issue":"3","key":"812_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2009.10.001","volume":"412","author":"F Wang","year":"2011","unstructured":"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\u2013269","journal-title":"Theor Comput Sci"},{"key":"812_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013321","DOI":"10.1007\/978-3-642-02026-1_29"},{"key":"812_CR19","doi-asserted-by":"crossref","unstructured":"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\u201391","DOI":"10.1007\/978-3-642-25813-8_9"},{"issue":"4","key":"812_CR20","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey LA (1982) An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4):385\u2013393","journal-title":"Combinatorica"},{"issue":"1","key":"812_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s13278-011-0033-9","volume":"2","author":"W Zhang","year":"2012","unstructured":"Zhang W, Wu W, Wang F, Xu K (2012) Positive influence dominating sets in power-law graphs. Soc Netw Anal Mining 2(1):31\u201337","journal-title":"Soc Netw Anal Mining"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00812-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00812-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00812-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:27:03Z","timestamp":1659079623000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00812-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,6]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["812"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00812-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,6]]},"assertion":[{"value":"15 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}