{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T09:47:54Z","timestamp":1780739274111,"version":"3.54.1"},"reference-count":150,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T00:00:00Z","timestamp":1585440000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T00:00:00Z","timestamp":1585440000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004541","name":"Ministry of Human Resource Development","doi-asserted-by":"publisher","award":["Grant No. F.No.5-5\/2014-TS.VII."],"award-info":[{"award-number":["Grant No. F.No.5-5\/2014-TS.VII."]}],"id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10115-020-01461-4","type":"journal-article","created":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T11:02:35Z","timestamp":1585479755000},"page":"3417-3455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":220,"title":["A survey on influence maximization in a social network"],"prefix":"10.1007","volume":"62","author":[{"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mamata","family":"Jenamani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dilip Kumar","family":"Pratihar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,3,29]]},"reference":[{"issue":"44\u201346","key":"1461_CR1","doi-asserted-by":"crossref","first-page":"4017","DOI":"10.1016\/j.tcs.2010.08.021","volume":"411","author":"E Ackerman","year":"2010","unstructured":"Ackerman E, Ben-Zwi O, Wolfovitz G (2010) Combinatorial model and bounds for target set selection. Theor Comput Sci 411(44\u201346):4017\u20134022","journal-title":"Theor Comput Sci"},{"key":"1461_CR2","doi-asserted-by":"crossref","unstructured":"Angell R, Schoenebeck G (2017) Dont be greedy: leveraging community structure to find high quality seed sets for influence maximization. In: International conference on web and internet economics. Springer, pp 16\u201329","DOI":"10.1007\/978-3-319-71924-5_2"},{"key":"1461_CR3","doi-asserted-by":"crossref","unstructured":"Arora A, Galhotra S, Ranu S (2017) Debunking the myths of influence maximization: an in-depth benchmarking study. In: Proceedings of the 2017 ACM international conference on management of data. ACM, pp 651\u2013666","DOI":"10.1145\/3035918.3035924"},{"key":"1461_CR4","doi-asserted-by":"crossref","unstructured":"Bakshy E, Hofman JM, Mason WA, Watts DJ (2011) Everyone\u2019s an influencer: quantifying influence on twitter. In: Proceedings of the fourth ACM international conference on Web search and data mining. ACM, pp 65\u201374","DOI":"10.1145\/1935826.1935845"},{"issue":"5\u20136","key":"1461_CR5","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1017\/S0963548310000271","volume":"19","author":"J Balogh","year":"2010","unstructured":"Balogh J, Bollob\u00e1s B, Morris R (2010) Bootstrap percolation in high dimensions. Comb Probab Comput 19(5\u20136):643\u2013692","journal-title":"Comb Probab Comput"},{"key":"1461_CR6","doi-asserted-by":"crossref","unstructured":"Banerjee P, Chen W, Lakshmanan LV (2019) Maximizing welfare in social networks under a utility driven influence diffusion model. In: Proceedings of the 2019 international conference on management of data. ACM, pp 1078\u20131095","DOI":"10.1145\/3299869.3319879"},{"key":"1461_CR7","unstructured":"Banerjee S, Mathew R (2018) An inapproximability result for the target set selection problem on bipartite graphs. arXiv preprint arXiv:1812.01482"},{"key":"1461_CR8","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.jda.2014.05.001","volume":"27","author":"C Bazgan","year":"2014","unstructured":"Bazgan C, Chopin M, Nichterlein A, Sikora F (2014) Parameterized approximability of maximizing the spread of influence in networks. J Discrete Algorithms 27:54\u201365","journal-title":"J Discrete Algorithms"},{"key":"1461_CR9","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"issue":"6","key":"1461_CR10","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1016\/j.ipm.2016.05.006","volume":"52","author":"A Bozorgi","year":"2016","unstructured":"Bozorgi A, Haghighi H, Zahedi MS, Rezvani M (2016) Incim: A community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52(6):1188\u20131199","journal-title":"Inf Process Manag"},{"issue":"1\u20137","key":"1461_CR11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"1461_CR12","doi-asserted-by":"crossref","unstructured":"Bucur D, Iacca G (2016) Influence maximization in social networks with genetic algorithms. In: European conference on the applications of evolutionary computation. Springer, pp 379\u2013392","DOI":"10.1007\/978-3-319-31204-0_25"},{"issue":"1","key":"1461_CR13","first-page":"61","volume":"20","author":"WM Campbell","year":"2013","unstructured":"Campbell WM, Dagli CK, Weinstein CJ (2013) Social network analysis with content and graphs. Linc Lab J 20(1):61\u201381","journal-title":"Linc Lab J"},{"issue":"5996","key":"1461_CR14","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1126\/science.1185231","volume":"329","author":"D Centola","year":"2010","unstructured":"Centola D (2010) The spread of behavior in an online social network experiment. Science 329(5996):1194\u20131197","journal-title":"Science"},{"issue":"4","key":"1461_CR15","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/3091106","volume":"50","author":"T Chakraborty","year":"2017","unstructured":"Chakraborty T, Dalmia A, Mukherjee A, Ganguly N (2017) Metrics for community analysis: a survey. ACM Comput Surv (CSUR) 50(4):54","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1461_CR16","unstructured":"Charikar M, Naamad Y, Wirth A (2016) On approximating target set selection. In: LIPIcs-Leibniz international proceedings in informatics, vol\u00a060. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"issue":"3","key":"1461_CR17","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen N (2009) On the approximability of influence in social networks. SIAM J Discrete Math 23(3):1400\u20131415","journal-title":"SIAM J Discrete Math"},{"issue":"6","key":"1461_CR18","doi-asserted-by":"crossref","first-page":"666","DOI":"10.14778\/2735703.2735706","volume":"8","author":"S Chen","year":"2015","unstructured":"Chen S, Fan J, Li G, Feng J, Kl Tan, Tang J (2015) Online topic-aware influence maximization. Proc VLDB Endow 8(6):666\u2013677","journal-title":"Proc VLDB Endow"},{"key":"1461_CR19","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"1461_CR20","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"1461_CR21","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE 10th international conference on data mining (ICDM). IEEE, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"1461_CR22","doi-asserted-by":"crossref","unstructured":"Chen W, Collins A, Cummings R, Ke T, Liu Z, Rincon D, Sun X, Wang Y, Wei W, Yuan Y (2011) Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the 2011 SIAM international conference on data mining. SIAM, pp 379\u2013390","DOI":"10.1137\/1.9781611972818.33"},{"key":"1461_CR23","unstructured":"Chen Y, Chang S, Chou C, Peng W, Lee S (2012) Exploring community structures for influence maximization in social networks. In: Proceedings of the 6th SNA-KDD workshop on social network mining and analysis held in conjunction with KDD12 (SNA-KDD12), pp 1\u20136"},{"issue":"2","key":"1461_CR24","first-page":"25","volume":"5","author":"YC Chen","year":"2014","unstructured":"Chen YC, Zhu WY, Peng WC, Lee WC, Lee SY (2014) Cim: community-based influence maximization in social networks. ACM Trans Intell Syst Technol (TIST) 5(2):25","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"1461_CR25","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM international conference on information & knowledge management. ACM, pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"1461_CR26","first-page":"120","volume-title":"Constant thresholds can make target set selection tractable","author":"M Chopin","year":"2012","unstructured":"Chopin M, Nichterlein A, Niedermeier R, Weller M (2012) Constant thresholds can make target set selection tractable. Springer, Berlin, pp 120\u2013133"},{"issue":"1","key":"1461_CR27","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00224-013-9499-3","volume":"55","author":"M Chopin","year":"2014","unstructured":"Chopin M, Nichterlein A, Niedermeier R, Weller M (2014) Constant thresholds can make target set selection tractable. Theory Comput Syst 55(1):61\u201383","journal-title":"Theory Comput Syst"},{"key":"1461_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2014.02.027","volume":"535","author":"F Cicalese","year":"2014","unstructured":"Cicalese F, Cordasco G, Gargano L, Milani\u010d M, Vaccaro U (2014) Latency-bounded target set selection in social networks. Theor Comput Sci 535:1\u201315","journal-title":"Theor Comput Sci"},{"issue":"6","key":"1461_CR29","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111","journal-title":"Phys Rev E"},{"key":"1461_CR30","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck RF (2014) Sketch-based influence maximization and computation: scaling up with guarantees. In: Proceedings of the 23rd ACM international conference on conference on information and knowledge management. ACM, pp 629\u2013638","DOI":"10.1145\/2661829.2662077"},{"key":"1461_CR31","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Mecchia M, Rescigno AA, Vaccaro U (2015a) A fast and effective heuristic for discovering small target sets in social networks. In: Combinatorial optimization and applications. Springer, pp 193\u2013208","DOI":"10.1007\/978-3-319-26626-8_15"},{"key":"1461_CR32","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Rescigno AA (2015b) Influence propagation over large scale social networks. In: Proceedings of the 2015 IEEE\/ACM international conference on advances in social networks analysis and mining 2015. ACM, pp 1531\u20131538","DOI":"10.1145\/2808797.2808888"},{"key":"1461_CR33","unstructured":"Cordasco G, Gargano L, Rescigno AA (2016) Active spreading in networks. In: ICTCS, pp 149\u2013162"},{"issue":"8","key":"1461_CR34","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1016\/j.jedc.2003.04.002","volume":"28","author":"R Cowan","year":"2004","unstructured":"Cowan R, Jonard N (2004) Network structure and the diffusion of knowledge. J Econ Dyn Control 28(8):1557\u20131575","journal-title":"J Econ Dyn Control"},{"issue":"4","key":"1461_CR35","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TNSE.2016.2610838","volume":"3","author":"S Dhamal","year":"2016","unstructured":"Dhamal S, Prabuchandran K, Narahari Y (2016) Information diffusion in social networks in two phases. IEEE Trans Netw Sci Eng 3(4):197\u2013210","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"1461_CR36","doi-asserted-by":"crossref","unstructured":"Diestel R (2005) Graph theory. 2005. Grad Texts in Math 101","DOI":"10.4171\/owr\/2005\/03"},{"key":"1461_CR37","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"1461_CR38","volume-title":"Parameterized complexity","author":"RG Downey","year":"2012","unstructured":"Downey RG, Fellows MR (2012) Parameterized complexity. Springer, Berlin"},{"key":"1461_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey RG, Fellows MR (2013) Fundamentals of parameterized complexity, vol 4. Springer, Berlin"},{"issue":"1\u20132","key":"1461_CR40","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0304-3975(96)00317-9","volume":"191","author":"RG Downey","year":"1998","unstructured":"Downey RG, Fellows MR, Regan KW (1998) Parameterized circuit complexity and the W hierarchy. Theor Comput Sci 191(1\u20132):97\u2013115","journal-title":"Theor Comput Sci"},{"issue":"7","key":"1461_CR41","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer","year":"2009","unstructured":"Dreyer PA, Roberts FS (2009) Irreversible k-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl Math 157(7):1615\u20131627","journal-title":"Discrete Appl Math"},{"key":"1461_CR42","doi-asserted-by":"crossref","unstructured":"Epasto A, Mahmoody A, Upfal E (2017) Real-time targeted-influence queries over large graphs. In: Proceedings of the 2017 IEEE\/ACM international conference on advances in social networks analysis and mining 2017. ACM, pp 224\u2013231","DOI":"10.1145\/3110025.3110105"},{"key":"1461_CR43","unstructured":"Feige U, Goemans M (1995) Approximating the value of two power proof systems, with applications to max 2sat and max dicut"},{"issue":"3","key":"1461_CR44","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75\u2013174","journal-title":"Phys Rep"},{"issue":"3","key":"1461_CR45","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239","journal-title":"Soc Netw"},{"key":"1461_CR46","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Virinchi S, Roy S (2015) Asim: a scalable algorithm for influence maximization under the independent cascade model. In: Proceedings of the 24th international conference on world wide web. ACM, pp 35\u201336","DOI":"10.1145\/2740908.2742725"},{"key":"1461_CR47","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Roy S (2016) Holistic influence maximization: combining scalability and efficiency with opinion-aware models. In: Proceedings of the 2016 international conference on management of data. ACM, pp 743\u2013758","DOI":"10.1145\/2882903.2882929"},{"key":"1461_CR48","volume-title":"Computers and intractability","author":"MR Garey","year":"2002","unstructured":"Garey MR, Johnson DS (2002) Computers and intractability, vol 29. W. H. Freeman, New York"},{"key":"1461_CR49","doi-asserted-by":"crossref","unstructured":"Gionis A, Terzi E, Tsaparas P (2013) Opinion maximization in social networks. In: Proceedings of the 2013 SIAM international conference on data mining. SIAM, pp 387\u2013395","DOI":"10.1137\/1.9781611972832.43"},{"key":"1461_CR50","doi-asserted-by":"crossref","unstructured":"Goel S, Watts DJ, Goldstein DG (2012) The structure of online diffusion networks. In: Proceedings of the 13th ACM conference on electronic commerce. ACM, pp 623\u2013638","DOI":"10.1145\/2229012.2229058"},{"key":"1461_CR51","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367","author":"M Gong","year":"2016","unstructured":"Gong M, Yan J, Shen B, Ma L, Cai Q (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367:600\u2013614","journal-title":"Inf Sci"},{"key":"1461_CR52","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2010) Learning influence probabilities in social networks. In: Proceedings of the third ACM international conference on Web search and data mining. ACM, pp 241\u2013250","DOI":"10.1145\/1718487.1718518"},{"issue":"1","key":"1461_CR53","doi-asserted-by":"crossref","first-page":"73","DOI":"10.14778\/2047485.2047492","volume":"5","author":"A Goyal","year":"2011","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2011a) A data-based approach to social influence maximization. Proc. VLDB Endow. 5(1):73\u201384","journal-title":"Proc. VLDB Endow."},{"key":"1461_CR54","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011b) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web. ACM, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"1461_CR55","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011c) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining (ICDM). IEEE, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"1461_CR56","doi-asserted-by":"crossref","unstructured":"Gruhl D, Guha R, Liben-Nowell D, Tomkins A (2004) Information diffusion through blogspace. In: Proceedings of the 13th international conference on world wide web. ACM, pp 491\u2013501","DOI":"10.1145\/988672.988739"},{"key":"1461_CR57","doi-asserted-by":"crossref","unstructured":"Han K, Huang K, Xiao X, Tang J, Sun A, Tang X (2018) Efficient algorithms for adaptive influence maximization. In: Proceedings of the VLDB endowment, vol 11, no 9","DOI":"10.14778\/3213880.3213883"},{"issue":"6","key":"1461_CR58","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1017\/S0963548399004034","volume":"8","author":"J Harant","year":"1999","unstructured":"Harant J, Pruchnewski A, Voigt M (1999) On dominating sets and independent sets of graphs. Comb Probab Comput 8(6):547\u2013553","journal-title":"Comb Probab Comput"},{"key":"1461_CR59","unstructured":"Heidari N (2016) Modeling information diffusion in social networks. arXiv preprint arXiv:1603.02178"},{"key":"1461_CR60","doi-asserted-by":"crossref","unstructured":"Ienco D, Bonchi F, Castillo C (2010) The meme ranking problem: maximizing microblogging virality. In: 2010 IEEE international conference on data mining workshops (ICDMW). IEEE, pp 328\u2013335","DOI":"10.1109\/ICDMW.2010.127"},{"key":"1461_CR61","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Cong G, Wang Y, Si W, Xie K (2011) Simulated annealing based influence maximization in social networks. In: AAAI, vol\u00a011, pp 127\u2013132","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"1461_CR62","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) Irie: scalable and robust influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining (ICDM). IEEE, pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"1461_CR63","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.artint.2016.06.008","volume":"239","author":"C Kang","year":"2016","unstructured":"Kang C, Kraus S, Molinaro C, Spezzano F, Subrahmanian V (2016) Diffusion centrality: a paradigm to maximize spread in social networks. Artif Intell 239:70\u201396","journal-title":"Artif Intell"},{"key":"1461_CR64","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations. Springer, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1461_CR65","doi-asserted-by":"crossref","unstructured":"Kasprzak R (2012) Diffusion in networks. J Telecommun Inf Technol 99\u2013106","DOI":"10.26636\/jtit.2012.2.1270"},{"key":"1461_CR66","doi-asserted-by":"crossref","unstructured":"Ke X, Khan A, Cong G (2018) Finding seeds and relevant tags jointly: for targeted influence maximization in social networks. In: Proceedings of the 2018 international conference on management of data. ACM, pp 1097\u20131111","DOI":"10.1145\/3183713.3199670"},{"key":"1461_CR67","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1461_CR68","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, Tardos \u00c9 (2005) Influential nodes in a diffusion model for social networks. In: ICALP, vol\u00a05. Springer, pp 1127\u20131138","DOI":"10.1007\/11523468_91"},{"issue":"4","key":"1461_CR69","doi-asserted-by":"crossref","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe D, Kleinberg JM, Tardos \u00c9 (2015) Maximizing the spread of influence through a social network. Theory Comput 11(4):105\u2013147","journal-title":"Theory Comput"},{"issue":"1","key":"1461_CR70","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller S, Moss A, Naor JS (1999) The budgeted maximum coverage problem. Inf Process Lett 70(1):39\u201345","journal-title":"Inf Process Lett"},{"key":"1461_CR71","unstructured":"Kim J, Kim SK, Yu H (2013) Scalable and parallelizable processing of influence maximization for large-scale social networks? In: 2013 IEEE 29th international conference on data engineering (ICDE). IEEE, pp 266\u2013277"},{"key":"1461_CR72","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: Knowledge discovery in databases: PKDD 2006, pp 259\u2013271","DOI":"10.1007\/11871637_27"},{"key":"1461_CR73","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K, Nakano R, Motoda H (2009) Finding influential nodes in a social network from information diffusion data. In: Social computing and behavioral modeling, pp 1\u20138","DOI":"10.1007\/978-1-4419-0056-2_18"},{"issue":"2","key":"1461_CR74","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ipl.2003.10.004","volume":"89","author":"R Klasing","year":"2004","unstructured":"Klasing R, Laforest C (2004) Hardness results and approximation algorithms of k-tuple domination in graphs. Inf Process Lett 89(2):75\u201383","journal-title":"Inf Process Lett"},{"issue":"3","key":"1461_CR75","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/s00453-001-0021-y","volume":"30","author":"G Kortsarz","year":"2001","unstructured":"Kortsarz G (2001) On the hardness of approximating spanners. Algorithmica 30(3):432\u2013450","journal-title":"Algorithmica"},{"issue":"6","key":"1461_CR76","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s12599-010-0127-3","volume":"2","author":"A Landherr","year":"2010","unstructured":"Landherr A, Friedl B, Heidemann J (2010) A critical review of centrality measures in social networks. Bus Inf Syst Eng 2(6):371\u2013385","journal-title":"Bus Inf Syst Eng"},{"issue":"2","key":"1461_CR77","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/TKDE.2014.2330833","volume":"27","author":"JR Lee","year":"2015","unstructured":"Lee JR, Chung CW (2015) A query approach for influence maximization on specific users in social networks. IEEE Trans Knowl Data Eng 27(2):340\u2013353","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1461_CR78","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. ACM, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"1461_CR79","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007a) The dynamics of viral marketing. ACM Trans Web (TWEB) 1(1):5","journal-title":"ACM Trans Web (TWEB)"},{"key":"1461_CR80","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007b) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1461_CR81","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1016\/j.neucom.2017.10.007","volume":"275","author":"X Li","year":"2018","unstructured":"Li X, Cheng X, Su S, Sun C (2018a) Community-based seeds selection algorithm for location aware influence maximization. Neurocomputing 275:1601\u20131613","journal-title":"Neurocomputing"},{"key":"1461_CR82","doi-asserted-by":"crossref","unstructured":"Li Y, Chen W, Wang Y, Zhang ZL (2013) Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: Proceedings of the sixth ACM international conference on web search and data mining. ACM, pp 657\u2013666","DOI":"10.1145\/2433396.2433478"},{"issue":"10","key":"1461_CR83","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.14778\/2794367.2794376","volume":"8","author":"Y Li","year":"2015","unstructured":"Li Y, Zhang D, Tan KL (2015) Real-time targeted influence maximization for online advertisements. Proc VLDB Endow 8(10):1070\u20131081","journal-title":"Proc VLDB Endow"},{"key":"1461_CR84","doi-asserted-by":"crossref","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Tan KL (2018b) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30:1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1461_CR85","doi-asserted-by":"crossref","unstructured":"Liu B (2011) Social network analysis. In: Web data mining. Springer, Berlin, pp 269\u2013309","DOI":"10.1007\/978-3-642-19460-3_7"},{"key":"1461_CR86","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.procs.2017.08.306","volume":"113","author":"SJ Liu","year":"2017","unstructured":"Liu SJ, Chen CY, Tsai CW (2017) An effective simulated annealing for influence maximization problem of online social networks. Proc Comput Sci 113:478\u2013483","journal-title":"Proc Comput Sci"},{"key":"1461_CR87","doi-asserted-by":"crossref","unstructured":"Ma H, Yang H, Lyu MR, King I (2008) Mining social networks using heat diffusion processes for marketing candidates selection. In: Proceedings of the 17th ACM conference on information and knowledge management. ACM, pp 233\u2013242","DOI":"10.1145\/1458082.1458115"},{"key":"1461_CR88","doi-asserted-by":"crossref","unstructured":"Maehara T, Suzuki H, Ishihata M (2017) Exact computation of influence spread by binary decision diagrams. In: Proceedings of the 26th international conference on world wide web, international world wide web conferences steering committee, pp 947\u2013956","DOI":"10.1145\/3038912.3052567"},{"issue":"1","key":"1461_CR89","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam R, Narahari Y (2011) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130\u2013147","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"1","key":"1461_CR90","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.physa.2006.07.017","volume":"374","author":"M Nekovee","year":"2007","unstructured":"Nekovee M, Moreno Y, Bianconi G, Marsili M (2007) Theory of rumour spreading in complex social networks. Phys A 374(1):457\u2013470","journal-title":"Phys A"},{"key":"1461_CR91","unstructured":"Nguyen H, Zheng R (2012) On budgeted influence maximization in social networks. arXiv preprint arXiv:1204.4491"},{"issue":"6","key":"1461_CR92","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen H, Zheng R (2013) On budgeted influence maximization in social networks. IEEE J Sel Areas Commun 31(6):1084\u20131094","journal-title":"IEEE J Sel Areas Commun"},{"key":"1461_CR93","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Dinh TN, Thai MT (2016a) Cost-aware targeted viral marketing in billion-scale networks. In: IEEE INFOCOM 2016-the 35th annual IEEE international conference on computer communications. IEEE, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524377"},{"key":"1461_CR94","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016b) Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 international conference on management of data. ACM, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"issue":"2","key":"1461_CR95","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/3086700","volume":"36","author":"HT Nguyen","year":"2017","unstructured":"Nguyen HT, Ghosh P, Mayo ML, Dinh TN (2017) Social influence spectrum at scale: near-optimal solutions for multiple budgets at once. ACM Trans Inf Syst (TOIS) 36(2):14","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"1461_CR96","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1109\/TNET.2017.2691544","volume":"25","author":"HT Nguyen","year":"2017","unstructured":"Nguyen HT, Thai MT, Dinh TN (2017) A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE\/ACM Trans Netw 25:2419\u20132429","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1461_CR97","doi-asserted-by":"crossref","unstructured":"Nichterlein A, Niedermeier R, Uhlmann J, Weller M (2010) On tractable cases of target set selection. In: Algorithms and computation, pp 378\u2013389","DOI":"10.1007\/978-3-642-17517-6_34"},{"issue":"2","key":"1461_CR98","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s13278-012-0067-7","volume":"3","author":"A Nichterlein","year":"2013","unstructured":"Nichterlein A, Niedermeier R, Uhlmann J, Weller M (2013) On tractable cases of target set selection. Soc Netw Anal Min 3(2):233\u2013256","journal-title":"Soc Netw Anal Min"},{"issue":"2","key":"1461_CR99","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D Peleg","year":"2002","unstructured":"Peleg D (2002) Local majorities, coalitions and monopolies in graphs: a review. Theor Comput Sci 282(2):231\u2013257","journal-title":"Theor Comput Sci"},{"key":"1461_CR100","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.jnca.2018.01.005","volume":"106","author":"S Peng","year":"2018","unstructured":"Peng S, Zhou Y, Cao L, Yu S, Niu J, Jia W (2018) Influence analysis in social networks: a survey. J Netw Comput Appl 106:17\u201332","journal-title":"J Netw Comput Appl"},{"key":"1461_CR101","unstructured":"Raghavan S, Zhang R (2015) Weighted target set selection on social networks. Technical report, Working paper, University of Maryland"},{"issue":"3","key":"1461_CR102","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1016\/j.eswa.2014.09.037","volume":"42","author":"K Rahimkhani","year":"2015","unstructured":"Rahimkhani K, Aleahmad A, Rahgozar M, Moeini A (2015) A fast algorithm for finding most influential people based on the linear threshold model. Expert Syst Appl 42(3):1353\u20131361","journal-title":"Expert Syst Appl"},{"key":"1461_CR103","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/978-3-540-85097-7_11","volume":"5165","author":"V Raman","year":"2008","unstructured":"Raman V, Saurabh S, Srihari S (2008) Parameterized algorithms for generalized domination. Lect Notes Comput Sci 5165:116\u2013126","journal-title":"Lect Notes Comput Sci"},{"key":"1461_CR104","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"1461_CR105","doi-asserted-by":"crossref","unstructured":"Saito K, Nakano R, Kimura M (2008) Prediction of information diffusion probabilities for independent cascade model. In: Knowledge-based intelligent information and engineering systems. Springer, pp 67\u201375","DOI":"10.1007\/978-3-540-85567-5_9"},{"key":"1461_CR106","doi-asserted-by":"crossref","unstructured":"Saito K, Kimura M, Ohara K, Motoda H (2010) Selecting information diffusion models over social networks for behavioral analysis. In: Machine learning and knowledge discovery in databases, pp 180\u2013195","DOI":"10.1007\/978-3-642-15939-8_12"},{"key":"1461_CR107","doi-asserted-by":"crossref","unstructured":"Saito K, Ohara K, Yamagishi Y, Kimura M, Motoda H (2011) Learning diffusion probability based on node attributes in social networks. In: International symposium on methodologies for intelligent systems. Springer, pp 153\u2013162","DOI":"10.1007\/978-3-642-21916-0_18"},{"issue":"51","key":"1461_CR108","doi-asserted-by":"crossref","first-page":"22020","DOI":"10.1073\/pnas.1009094108","volume":"107","author":"M Salath\u00e9","year":"2010","unstructured":"Salath\u00e9 M, Kazandjieva M, Lee JW, Levis P, Feldman MW, Jones JH (2010) A high-resolution human contact network for infectious disease transmission. Proc Nat Acad Sci 107(51):22020\u201322025","journal-title":"Proc Nat Acad Sci"},{"issue":"12","key":"1461_CR109","doi-asserted-by":"crossref","first-page":"e0168125","DOI":"10.1371\/journal.pone.0168125","volume":"11","author":"CP Sankar","year":"2016","unstructured":"Sankar CP, Asharaf S, Kumar KS (2016) Learning from bees: an approach for influence maximization on viral campaigns. PLoS ONE 11(12):e0168125","journal-title":"PLoS ONE"},{"key":"1461_CR110","doi-asserted-by":"crossref","unstructured":"Shakarian P, Bhatnagar A, Aleali A, Shaabani E, Guo R (2015) The independent cascade and linear threshold models. In: Diffusion in social networks. Springer, pp 35\u201348","DOI":"10.1007\/978-3-319-23105-1_4"},{"key":"1461_CR111","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: a community-based framework for influence maximization on large-scale networks. Knowl Based Syst 117:88\u2013100","journal-title":"Knowl Based Syst"},{"key":"1461_CR112","doi-asserted-by":"crossref","unstructured":"Song X, Tseng BL, Lin CY, Sun MT (2006) Personalized recommendation driven by information flow. In: Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval. ACM, pp 509\u2013516","DOI":"10.1145\/1148170.1148258"},{"key":"1461_CR113","doi-asserted-by":"crossref","unstructured":"Sun J, Tang J (2011) A survey of models and algorithms for social influence analysis. In: Social network data analytics. Springer, Berlin, pp 177\u2013214","DOI":"10.1007\/978-1-4419-8462-3_7"},{"key":"1461_CR114","doi-asserted-by":"crossref","unstructured":"Sun L, Huang W, Yu PS, Chen W (2018) Multi-round influence maximization. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. ACM, pp 2249\u20132258","DOI":"10.1145\/3219819.3220101"},{"key":"1461_CR115","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.physa.2013.09.010","volume":"394","author":"BM Tabak","year":"2014","unstructured":"Tabak BM, Takami M, Rocha JM, Cajueiro DO, Souza SR (2014) Directed clustering coefficient as a measure of systemic risk in complex banking networks. Phys A 394:211\u2013216","journal-title":"Phys A"},{"key":"1461_CR116","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Yuan J (2017) Influence maximization meets efficiency and effectiveness: a hop-based approach. In: Proceedings of the 2017 IEEE\/ACM international conference on advances in social networks analysis and mining 2017. ACM, pp 64\u201371","DOI":"10.1145\/3110025.3110041"},{"issue":"1","key":"1461_CR117","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/s13278-018-0489-y","volume":"8","author":"J Tang","year":"2018","unstructured":"Tang J, Tang X, Yuan J (2018) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8(1):10","journal-title":"Soc Netw Anal Min"},{"key":"1461_CR118","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data. ACM, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"1461_CR119","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data. ACM, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"issue":"1","key":"1461_CR120","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","volume":"25","author":"G Tong","year":"2017","unstructured":"Tong G, Wu W, Tang S, Du DZ (2017) Adaptive influence maximization in dynamic social networks. IEEE\/ACM Trans Netw (TON) 25(1):112\u2013125","journal-title":"IEEE\/ACM Trans Netw (TON)"},{"issue":"1","key":"1461_CR121","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey CA (1984) A simplified np-complete satisfiability problem. Discrete Appl Math 8(1):85\u201389","journal-title":"Discrete Appl Math"},{"key":"1461_CR122","doi-asserted-by":"crossref","unstructured":"Tsai CW, Yang YC, Chiang MC (2015) A genetic newgreedy algorithm for influence maximization in social network. In: 2015 IEEE international conference on systems, man, and cybernetics (SMC). IEEE, pp 2549\u20132554","DOI":"10.1109\/SMC.2015.446"},{"key":"1461_CR123","doi-asserted-by":"crossref","unstructured":"Valente TW (1995) Network models of the diffusion of innovations","DOI":"10.1007\/BF00240425"},{"issue":"1","key":"1461_CR124","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0378-8733(95)00256-1","volume":"18","author":"TW Valente","year":"1996","unstructured":"Valente TW (1996) Social network thresholds in the diffusion of innovations. Soc Netw 18(1):69\u201389","journal-title":"Soc Netw"},{"key":"1461_CR125","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.knosys.2017.07.003","volume":"133","author":"D Varshney","year":"2017","unstructured":"Varshney D, Kumar S, Gupta V (2017) Predicting information diffusion probabilities in social networks: a Bayesian networks based approach. Knowl Based Syst 133:66\u201376","journal-title":"Knowl Based Syst"},{"issue":"3","key":"1461_CR126","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowl Disc 25(3):545","journal-title":"Data Min Knowl Disc"},{"key":"1461_CR127","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1016\/j.future.2017.05.050","volume":"86","author":"F Wang","year":"2017","unstructured":"Wang F, Jiang W, Li X, Wang G (2017a) Maximizing positive influence spread in online social networks via fluid dynamics. Future Gener Comput Syst 86:1491\u20131502","journal-title":"Future Gener Comput Syst"},{"key":"1461_CR128","unstructured":"Wang Q, Gong M, Song C, Wang S (2017b) Discrete particle swarm optimization based influence maximization in complex networks. In: 2017 IEEE congress on evolutionary computation (CEC). IEEE, pp 488\u2013494"},{"key":"1461_CR129","doi-asserted-by":"crossref","unstructured":"Wang T, Chen Y, Zhang Z, Xu T, Jin L, Hui P, Deng B, Li X (2011) Understanding graph sampling algorithms for social network analysis. In: 2011 31st international conference on distributed computing systems workshops (ICDCSW). IEEE, pp 123\u2013128","DOI":"10.1109\/ICDCSW.2011.34"},{"key":"1461_CR130","doi-asserted-by":"crossref","unstructured":"Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 1039\u20131048","DOI":"10.1145\/1835804.1835935"},{"key":"1461_CR131","doi-asserted-by":"crossref","unstructured":"Weng J, Lim EP, Jiang J, He Q (2010) Twitterrank: finding topic-sensitive influential twitterers. In: Proceedings of the third ACM international conference on Web search and data mining. ACM, pp 261\u2013270","DOI":"10.1145\/1718487.1718520"},{"key":"1461_CR132","unstructured":"Wilder B, Immorlica N, Rice E, Tambe M (2017) Influence maximization with an unknown network by exploiting community structure. In: SocInf@ IJCAI, pp 2\u20137"},{"key":"1461_CR133","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The design of approximation algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson DP, Shmoys DB (2011) The design of approximation algorithms. Cambridge University Press, Cambridge"},{"key":"1461_CR134","doi-asserted-by":"crossref","unstructured":"Wilson C, Boe B, Sala A, Puttaswamy KP, Zhao BY (2009) User interactions in social networks and their implications. In: Proceedings of the 4th ACM European conference on computer systems. ACM, pp 205\u2013218","DOI":"10.1145\/1519065.1519089"},{"key":"1461_CR135","unstructured":"Wu H, Yue K, Fu X, Wang Y, Liu W (2016) Parallel seed selection for influence maximization based on k-shell decomposition. In: International conference on collaborative computing: networking, applications and worksharing. Springer, pp 27\u201336"},{"key":"1461_CR136","first-page":"1","volume":"69","author":"HH Wu","year":"2017","unstructured":"Wu HH, K\u00fc\u00e7\u00fckyavuz S (2017) A two-stage stochastic programming approach for influence maximization in social networks. Comput Optim Appl 69:1\u201333","journal-title":"Comput Optim Appl"},{"key":"1461_CR137","doi-asserted-by":"crossref","unstructured":"Xie J, Szymanski BK, Liu X (2011) Slpa: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 IEEE 11th international conference on data mining workshops (ICDMW). IEEE, pp 344\u2013349","DOI":"10.1109\/ICDMW.2011.154"},{"key":"1461_CR138","unstructured":"Xu B, Liu L (2010) Information diffusion through online social networks. In: 2010 IEEE international conference on emergency management and management sciences (ICEMMS). IEEE, pp 53\u201356"},{"key":"1461_CR139","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2010) Modeling information diffusion in implicit networks. In: 2010 IEEE 10th international conference on data mining (ICDM). IEEE, pp 599\u2013608","DOI":"10.1109\/ICDM.2010.22"},{"key":"1461_CR140","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, Oxford"},{"key":"1461_CR141","first-page":"425853","volume":"2014","author":"XS Yang","year":"2014","unstructured":"Yang XS, Chien SF, Ting TO (2014) Computational intelligence and metaheuristic algorithms with applications. Sci World J 2014:425853","journal-title":"Sci World J"},{"issue":"5","key":"1461_CR142","doi-asserted-by":"crossref","first-page":"2433","DOI":"10.1016\/j.asoc.2012.12.004","volume":"13","author":"H Yi","year":"2013","unstructured":"Yi H, Duan Q, Liao TW (2013) Three improved hybrid metaheuristic algorithms for engineering design optimization. Appl Soft Comput 13(5):2433\u20132444","journal-title":"Appl Soft Comput"},{"key":"1461_CR143","doi-asserted-by":"crossref","unstructured":"Zhang H, Dinh TN, Thai MT (2013) Maximizing the spread of positive influence in online social networks. In: 2013 IEEE 33rd international conference on distributed computing systems (ICDCS). IEEE, pp 317\u2013326","DOI":"10.1109\/ICDCS.2013.37"},{"issue":"1.1","key":"1461_CR144","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1201\/b17231-3","volume":"37","author":"H Zhang","year":"2014","unstructured":"Zhang H, Mishra S, Thai MT, Wu J, Wang Y (2014) Recent advances in information diffusion and influence maximization in complex social networks. Oppor Mobile Soc Netw 37(1.1):37","journal-title":"Oppor Mobile Soc Netw"},{"key":"1461_CR145","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.physa.2017.02.067","volume":"478","author":"K Zhang","year":"2017","unstructured":"Zhang K, Du H, Feldman MW (2017) Maximizing influence in a social network: improved results using a genetic algorithm. Phys A 478:20\u201330","journal-title":"Phys A"},{"key":"1461_CR146","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ins.2014.03.070","volume":"278","author":"T Zhu","year":"2014","unstructured":"Zhu T, Wang B, Wu B, Zhu C (2014) Maximizing the spread of influence ranking in social networks. Inf Sci 278:535\u2013544","journal-title":"Inf Sci"},{"issue":"1","key":"1461_CR147","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10878-013-9635-7","volume":"30","author":"Y Zhu","year":"2015","unstructured":"Zhu Y, Wu W, Bi Y, Wu L, Jiang Y, Xu W (2015) Better approximation algorithms for influence maximization in online social networks. J Comb Optim 30(1):97\u2013108","journal-title":"J Comb Optim"},{"key":"1461_CR148","doi-asserted-by":"crossref","unstructured":"Zhuang H, Sun Y, Tang J, Zhang J, Sun X (2013) Influence maximization in dynamic social networks. In: 2013 IEEE 13th international conference on data mining (ICDM). IEEE, pp 1313\u20131318","DOI":"10.1109\/ICDM.2013.145"},{"key":"1461_CR149","doi-asserted-by":"crossref","unstructured":"Zong Z, Li B, Hu C (2014) dirier: distributed influence maximization in social network. In: 2014 20th IEEE international conference on parallel and distributed systems (ICPADS). IEEE, pp 119\u2013125","DOI":"10.1109\/PADSW.2014.7097799"},{"issue":"2","key":"1461_CR150","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TDSC.2007.1001","volume":"4","author":"CC Zou","year":"2007","unstructured":"Zou CC, Towsley D, Gong W (2007) Modeling and simulation study of the propagation and defense of internet e-mail worms. IEEE Trans Dependable Secure Comput 4(2):105\u2013118","journal-title":"IEEE Trans Dependable Secure Comput"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01461-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-020-01461-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01461-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T01:08:11Z","timestamp":1722647291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-020-01461-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,29]]},"references-count":150,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1461"],"URL":"https:\/\/doi.org\/10.1007\/s10115-020-01461-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,29]]},"assertion":[{"value":"24 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}