{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T19:29:14Z","timestamp":1782502154517,"version":"3.54.5"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T00:00:00Z","timestamp":1574899200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T00:00:00Z","timestamp":1574899200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00500-019-04533-y","type":"journal-article","created":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T18:03:12Z","timestamp":1574964192000},"page":"10181-10203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":84,"title":["ACO-IM: maximizing influence in social networks using ant colony optimization"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0909-2258","authenticated-orcid":false,"given":"Shashank Sheshar","family":"Singh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kuldeep","family":"Singh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajay","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bhaskar","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"3","key":"4533_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1086\/209118","volume":"14","author":"JJ Brown","year":"1987","unstructured":"Brown JJ, Reingen PH (1987) Social ties and word-of-mouth referralbehavior. J Consum Res 14(3):350\u2013362. https:\/\/doi.org\/10.1086\/209118","journal-title":"J Consum Res"},{"key":"4533_CR2","doi-asserted-by":"publisher","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, KDD \u201909. ACM, New York, pp 199\u2013208. https:\/\/doi.org\/10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"key":"4533_CR3","doi-asserted-by":"publisher","unstructured":"Chen W, Wang C, Wang Y (2010a) 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, KDD \u201910. ACM, New York, pp 1029\u20131038. https:\/\/doi.org\/10.1145\/1835804.1835934","DOI":"10.1145\/1835804.1835934"},{"key":"4533_CR4","doi-asserted-by":"publisher","unstructured":"Chen W, Yuan Y, Zhang L (2010b) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 2010 IEEE international conference on data mining, ICDM \u201910, IEEE Computer Society, Washington, DC, pp 88\u201397. https:\/\/doi.org\/10.1109\/ICDM.2010.118","DOI":"10.1109\/ICDM.2010.118"},{"key":"4533_CR5","doi-asserted-by":"publisher","DOI":"10.2200\/S00527ED1V01Y201308DTM037","volume-title":"Information and influence propagation in social networks","author":"W Chen","year":"2013","unstructured":"Chen W, Lakshmanan LVS, Castillo C (2013) Information and influence propagation in social networks. Morgan & Claypool Publishers, San Rafael"},{"issue":"2","key":"4533_CR6","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/2532549","volume":"5","author":"Y-C Chen","year":"2014","unstructured":"Chen Y-C, Zhu W-Y, Peng W-C, Lee W-C, Lee S-Y (2014) Cim: community-based influence maximization in social networks. ACM Trans Intell Syst Technol 5(2):25:1\u201325:31. https:\/\/doi.org\/10.1145\/2532549","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"6","key":"4533_CR7","doi-asserted-by":"publisher","first-page":"666","DOI":"10.14778\/2735703.2735706","volume":"8","author":"S Chen","year":"2015","unstructured":"Chen S, Fan J, Li G, Feng J, Tan K-L, Tang J (2015) Online topic-aware influence maximization. Proc VLDB Endow 8(6):666\u2013677. https:\/\/doi.org\/10.14778\/2735703.2735706","journal-title":"Proc VLDB Endow"},{"key":"4533_CR8","doi-asserted-by":"publisher","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, CIKM \u201913. ACM, New York, pp 509\u2013518. https:\/\/doi.org\/10.1145\/2505515.2505541","DOI":"10.1145\/2505515.2505541"},{"key":"4533_CR9","volume-title":"Connected: the surprising power of our social networks and how they shape our lives","author":"NA Christakis","year":"2009","unstructured":"Christakis NA, Fowler JH (2009) Connected: the surprising power of our social networks and how they shape our lives. Little, Brown"},{"issue":"1","key":"4533_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00e1 S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318. https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evol Comput"},{"key":"4533_CR11","doi-asserted-by":"publisher","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, KDD \u201901. ACM, New York, pp 57\u201366. https:\/\/doi.org\/10.1145\/502512.502525","DOI":"10.1145\/502512.502525"},{"issue":"2","key":"4533_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2):243\u2013278. https:\/\/doi.org\/10.1016\/j.tcs.2005.05.020","journal-title":"Theor Comput Sci"},{"key":"4533_CR13","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/0-306-48056-5_9","volume-title":"The ant colony optimization metaheuristic: algorithms, applications, and advances","author":"M Dorigo","year":"2003","unstructured":"Dorigo M, St\u00fctzle T (2003) The ant colony optimization metaheuristic: algorithms, applications, and advances. Springer, Boston, pp 250\u2013285. https:\/\/doi.org\/10.1007\/0-306-48056-5_9"},{"key":"4533_CR14","doi-asserted-by":"publisher","unstructured":"Dorigo M, Di Caro G (1999) Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), vol 2, pp 1470\u20131477. https:\/\/doi.org\/10.1109\/CEC.1999.782657","DOI":"10.1109\/CEC.1999.782657"},{"issue":"200","key":"4533_CR15","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675\u2013701. https:\/\/doi.org\/10.1080\/01621459.1937.10503522","journal-title":"J Am Stat Assoc"},{"key":"4533_CR16","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/DSC.2017.54","volume":"2017","author":"H Ge","year":"2017","unstructured":"Ge H, Huang J, Di C, Li J, Li S (2017) Learning automata based approach for influence maximization problem on social networks. IEEE Second Int Conf Data Sci Cyberspace 2017:108\u2013117. https:\/\/doi.org\/10.1109\/DSC.2017.54","journal-title":"IEEE Second Int Conf Data Sci Cyberspace"},{"issue":"3","key":"4533_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Market Lett 12(3):211\u2013223. https:\/\/doi.org\/10.1023\/A:1011122126881","journal-title":"Market Lett"},{"key":"4533_CR18","unstructured":"Gomez\u00a0Rodriguez M, Sch\u00f6lkopf B (2012) Influence maximization in continuous time diffusion networks. In: Proceedings of the 29th international conference on machine learning. Omnipress, New York, pp 313\u2013320"},{"issue":"2","key":"4533_CR19","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2824253","volume":"34","author":"M Gomez-Rodriguez","year":"2016","unstructured":"Gomez-Rodriguez M, Song L, Du N, Zha H, Sch\u00f6lkopf B (2016) Influence estimation and maximization in continuous-time diffusion networks. ACM Trans Inf Syst 34(2):9:1\u20139:33. https:\/\/doi.org\/10.1145\/2824253","journal-title":"ACM Trans Inf Syst"},{"key":"4533_CR20","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367\u2013368","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\u2013368:600\u2013614. https:\/\/doi.org\/10.1016\/j.ins.2016.07.012","journal-title":"Inf Sci"},{"key":"4533_CR21","doi-asserted-by":"publisher","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web, WWW \u201911, ACM, New York, pp 47\u201348. https:\/\/doi.org\/10.1145\/1963192.1963217","DOI":"10.1145\/1963192.1963217"},{"key":"4533_CR22","doi-asserted-by":"publisher","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: Proceedings of the 2011 IEEE 11th international conference on data mining, ICDM \u201911. IEEE Computer Society, Washington, DC, pp 211\u2013220. https:\/\/doi.org\/10.1109\/ICDM.2011.132","DOI":"10.1109\/ICDM.2011.132"},{"issue":"3","key":"4533_CR23","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1109\/TKDE.2016.2621038","volume":"29","author":"L Guo","year":"2017","unstructured":"Guo L, Zhang D, Cong G, Wu W, Tan KL (2017) Influence maximization in trajectory databases. IEEE Trans Knowl Data Eng 29(3):627\u2013641. https:\/\/doi.org\/10.1109\/TKDE.2016.2621038","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4533_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2018.2844256","author":"L Hu","year":"2018","unstructured":"Hu L, Yuan X, Liu X, Xiong S, Luo X (2018) Efficiently detecting protein complexes from protein interaction networks via alternating direction method of multipliers. IEEE ACM Trans Comput Biol Bioinf. https:\/\/doi.org\/10.1109\/TCBB.2018.2844256","journal-title":"IEEE ACM Trans Comput Biol Bioinf"},{"key":"4533_CR25","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2019.2914208","author":"L Hu","year":"2019","unstructured":"Hu L, Hu P, Yuan X, Luo X, You Z (2019) Incorporating the coevolving information of substrates in predicting hiv-1 protease cleavage sites. IEEE ACM Trans Comput Biol Bioinform. https:\/\/doi.org\/10.1109\/TCBB.2019.2914208","journal-title":"IEEE ACM Trans Comput Biol Bioinform"},{"issue":"1","key":"4533_CR26","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","volume":"271","author":"L Isella","year":"2011","unstructured":"Isella L, Stehl\u00e9 J, Barrat A, Cattuto C, Pinton J-F, den Broeck WV (2011) What\u2019s in a crowd? analysis of face-to-face behavioral networks. J Theor Biol 271(1):166\u2013180. https:\/\/doi.org\/10.1016\/j.jtbi.2010.11.033","journal-title":"J Theor Biol"},{"key":"4533_CR27","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: Proceedings of the twenty-fifth AAAI conference on artificial intelligence, AAAI\u201911. AAAI Press, pp 127\u2013132. http:\/\/dl.acm.org\/citation.cfm?id=2900423.2900443","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"4533_CR28","doi-asserted-by":"publisher","unstructured":"Jung K, Heo W, Chen W (2012) Irie: scalable and robust influence maximization in social networks. In: Proceedings of the 2012 IEEE 12th international conference on data mining, ICDM \u201912. IEEE Computer Society, Washington, DC, pp 918\u2013923. https:\/\/doi.org\/10.1109\/ICDM.2012.79","DOI":"10.1109\/ICDM.2012.79"},{"key":"4533_CR29","doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg J, Tardos E (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, KDD \u201903. ACM, New York, pp 137\u2013146. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"4533_CR30","doi-asserted-by":"publisher","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), pp 266\u2013277. https:\/\/doi.org\/10.1109\/ICDE.2013.6544831","DOI":"10.1109\/ICDE.2013.6544831"},{"key":"4533_CR31","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/11871637_27","volume-title":"Knowledge discovery in databases: PKDD 2006","author":"M Kimura","year":"2006","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: F\u00fcrnkranz J, Scheffer T, Spiliopoulou M (eds) Knowledge discovery in databases: PKDD 2006. Springer, Berlin, pp 259\u2013271"},{"key":"4533_CR32","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-21786-9_40","volume-title":"Pattern recognition and machine intelligence","author":"S Kundu","year":"2011","unstructured":"Kundu S, Murthy CA, Pal SK (2011) A new centrality measure for influence maximization in social networks. In: Kuznetsov SO, Mandal DP, Kundu MK, Pal SK (eds) Pattern recognition and machine intelligence. Springer, Berlin, pp 242\u2013247"},{"issue":"1145\/1217299","key":"4533_CR33","first-page":"1217301","volume":"10","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 10(1145\/1217299):1217301","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"1145\/1232722","key":"4533_CR34","first-page":"1232727","volume":"10","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 10(1145\/1232722):1232727","journal-title":"ACM Trans Web"},{"key":"4533_CR35","doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201907. ACM, New York, pp 420\u2013429. https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"issue":"10","key":"4533_CR36","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.14778\/2794367.2794376","volume":"8","author":"Y Li","year":"2015","unstructured":"Li Y, Zhang D, Tan K-L (2015) Real-time targeted influence maximization for online advertisements. Proc VLDB Endow 8(10):1070\u20131081. https:\/\/doi.org\/10.14778\/2794367.2794376","journal-title":"Proc VLDB Endow"},{"key":"4533_CR37","doi-asserted-by":"publisher","unstructured":"Li G, Chen S, Feng J, Tan K-l, Li W-s (2014) Efficient location-aware influence maximization. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, SIGMOD \u201914. ACM, New York, pp 87\u201398. https:\/\/doi.org\/10.1145\/2588555.2588561","DOI":"10.1145\/2588555.2588561"},{"issue":"2","key":"4533_CR38","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/TNET.2019.2898413","volume":"27","author":"X Li","year":"2019","unstructured":"Li X, Smith JD, Dinh TN, Thai MT (2019) Tiptop: (almost) exact solutions for influence maximization in billion-scale networks. IEEE ACM Trans Netw 27(2):649\u2013661. https:\/\/doi.org\/10.1109\/TNET.2019.2898413","journal-title":"IEEE ACM Trans Netw"},{"key":"4533_CR39","doi-asserted-by":"publisher","unstructured":"Lin S-C, Lin S-D, Chen M-S (2015) A learning-based framework to handle multi-round multi-party influence maximization on social networks. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201915. ACM, New York, pp 695\u2013704. https:\/\/doi.org\/10.1145\/2783258.2783392","DOI":"10.1145\/2783258.2783392"},{"issue":"3","key":"4533_CR40","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TNNLS.2015.2412037","volume":"27","author":"X Luo","year":"2016","unstructured":"Luo X, Zhou M, Xia Y, Zhu Q, Ammari AC, Alabdulwahab A (2016) Generating highly accurate predictions for missing qos data via aggregating nonnegative latent factor models. IEEE Trans Neural Netw Learn Syst 27(3):524\u2013537. https:\/\/doi.org\/10.1109\/TNNLS.2015.2412037","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"6","key":"4533_CR41","doi-asserted-by":"publisher","first-page":"3098","DOI":"10.1109\/TII.2017.2724769","volume":"13","author":"X Luo","year":"2017","unstructured":"Luo X, Sun J, Wang Z, Li S, Shang M (2017) Symmetric and nonnegative latent factor models for undirected, high-dimensional, and sparse networks in industrial applications. IEEE Trans Ind Inf 13(6):3098\u20133107. https:\/\/doi.org\/10.1109\/TII.2017.2724769","journal-title":"IEEE Trans Ind Inf"},{"key":"4533_CR42","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2894283","author":"X Luo","year":"2019","unstructured":"Luo X, Zhou M, Li S, Hu L, Shang M (2019) Non-negativity constrained missing data estimation for high-dimensional and sparse matrices from industrial applications. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2019.2894283","journal-title":"IEEE Trans Cybern"},{"key":"4533_CR43","first-page":"036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev 74:036104","journal-title":"Phys Rev"},{"key":"4533_CR44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2904969","author":"HT Nguyen","year":"2019","unstructured":"Nguyen HT, Cano A, Tam V, Dinh TN (2019) Blocking self-avoiding walks stops cyber-epidemics: a scalable gpu-based approach. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2019.2904969","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4533_CR45","doi-asserted-by":"crossref","unstructured":"Ohsaka N, Akiba T, Yoshida Y, Kawarabayashi K-I (2014) Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In: Proceedings of the twenty-eighth AAAI conference on artificial intelligence, AAAI\u201914. AAAI Press, pp 138\u2013144. http:\/\/dl.acm.org\/citation.cfm?id=2893873.2893897","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"4533_CR46","doi-asserted-by":"publisher","first-page":"5547","DOI":"10.1038\/srep05547","volume":"4","author":"S Pei","year":"2014","unstructured":"Pei S, Muchnik L, Andrade JS Jr, Zheng Z, Makse HA (2014) Searching for superspreaders of information in real-world social media. Sci Rep 4:5547","journal-title":"Sci Rep"},{"issue":"1","key":"4533_CR47","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/4236.978369","volume":"6","author":"M Ripeanu","year":"2002","unstructured":"Ripeanu M, Iamnitchi A, Foster I (2002) Mapping the gnutella network. IEEE Internet Comput 6(1):50\u201357. https:\/\/doi.org\/10.1109\/4236.978369","journal-title":"IEEE Internet Comput"},{"key":"4533_CR48","doi-asserted-by":"crossref","unstructured":"Singh SS, Kumar A, Singh K, Biswas B (2019a) Im-sso: maximizing influence in social networks using social spider optimization. Concurr Comput Pract Exp, e5421, e5421 cpe.5421. https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/cpe.5421","DOI":"10.1002\/cpe.5421"},{"key":"4533_CR49","doi-asserted-by":"publisher","first-page":"105554","DOI":"10.1016\/j.asoc.2019.105554","volume":"82","author":"SS Singh","year":"2019","unstructured":"Singh SS, Kumar A, Singh K, Biswas B (2019b) Lapso-im: a learning-based influence maximization approach for social networks. Appl Soft Comput 82:105554. https:\/\/doi.org\/10.1016\/j.asoc.2019.105554","journal-title":"Appl Soft Comput"},{"key":"4533_CR50","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-981-13-3143-5_36","volume-title":"Advanced informatics for computing research","author":"SS Singh","year":"2019","unstructured":"Singh SS, Singh K, Kumar A, Biswas B (2019c) Coim: community-based influence maximization in social networks. In: Luhach AK, Singh D, Hsiung P-A, Hawari KBG, Lingras P, Singh PK (eds) Advanced informatics for computing research. Springer, Singapore, pp 440\u2013453"},{"key":"4533_CR51","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.physa.2018.09.142","volume":"514","author":"SS Singh","year":"2019","unstructured":"Singh SS, Kumar A, Singh K, Biswas B (2019d) C2IM: community based context-aware influence maximization in social networks. Phys A Stat Mech Appl 514:796\u2013818. https:\/\/doi.org\/10.1016\/j.physa.2018.09.142","journal-title":"Phys A Stat Mech Appl"},{"key":"4533_CR52","doi-asserted-by":"publisher","first-page":"120902","DOI":"10.1016\/j.physa.2019.04.138","volume":"526","author":"SS Singh","year":"2019","unstructured":"Singh SS, Singh K, Kumar A, Biswas B (2019e) Mim2: multiple influence maximization across multiple social networks. Phys A Stat Mech Appl 526:120902. https:\/\/doi.org\/10.1016\/j.physa.2019.04.138","journal-title":"Phys A Stat Mech Appl"},{"issue":"1","key":"4533_CR53","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko M (2004) A note on maximizing a submodular set function subject to a knapsack constraint. Oper Res Lett 32(1):41\u201343. https:\/\/doi.org\/10.1016\/S0167-6377(03)00062-2","journal-title":"Oper Res Lett"},{"key":"4533_CR54","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD conference","DOI":"10.1145\/2588555.2593670"},{"key":"4533_CR55","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1137\/1.9781611975321.65","volume-title":"Proceedings of the 2018 SIAM International Conference on Data Mining","author":"Ya-Wen Teng","year":"2018","unstructured":"Teng Y-W, Tai C-H, Yu PS, Chen M-S (2018) Revenue Maximization on the multi-grade product, pp 576\u2013584. https:\/\/doi.org\/10.1137\/1.9781611975321.65"},{"key":"4533_CR56","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-03348-3_34","volume-title":"Adv Data Min Appl","author":"Y Wang","year":"2009","unstructured":"Wang Y, Feng X (2009) A potential-based node selection strategy for influence maximization in a social network. In: Huang R, Yang Q, Pei J, Gama J, Meng X, Li X (eds) Adv Data Min Appl. Springer, Berlin, pp 350\u2013361"},{"key":"4533_CR57","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: KDD","DOI":"10.1145\/1835804.1835935"},{"key":"4533_CR58","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.comnet.2017.05.004","volume":"123","author":"P Wu","year":"2017","unstructured":"Wu P, Pan L (2017) Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput Netw 123:38\u201350. https:\/\/doi.org\/10.1016\/j.comnet.2017.05.004","journal-title":"Comput Netw"},{"key":"4533_CR59","doi-asserted-by":"publisher","unstructured":"Ye M, Liu X, Lee W-C (2012) Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th international ACM SIGIR conference on research and development in information retrieval, SIGIR \u201912. ACM, New York, pp 671\u2013680. https:\/\/doi.org\/10.1145\/2348283.2348373","DOI":"10.1145\/2348283.2348373"},{"key":"4533_CR60","doi-asserted-by":"publisher","unstructured":"Zhu Y, Li D, Zhang Z (2016) Minimum cost seed set for competitive social influence. In: IEEE INFOCOM 2016-The 35th annual IEEE international conference on computer communications, pp 1\u20139. https:\/\/doi.org\/10.1109\/INFOCOM.2016.7524472","DOI":"10.1109\/INFOCOM.2016.7524472"},{"issue":"1","key":"4533_CR61","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/B:ANOR.0000039526.52305.af","volume":"131","author":"M Zlochin","year":"2004","unstructured":"Zlochin M, Birattari M, Meuleau N, Dorigo M (2004) Model-based search for combinatorial optimization: a critical survey. Ann Oper Res 131(1):373\u2013395. https:\/\/doi.org\/10.1023\/B:ANOR.0000039526.52305.af","journal-title":"Ann Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04533-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04533-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04533-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T04:35:39Z","timestamp":1665117339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04533-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,28]]},"references-count":61,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["4533"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04533-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,28]]},"assertion":[{"value":"28 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The article does not contain any studies with human or animal subjects. This article presents an algorithm ACO-IM.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human or animal rights"}}]}}