{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T11:43:20Z","timestamp":1768391000200,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T00:00:00Z","timestamp":1629072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T00:00:00Z","timestamp":1629072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100018941","name":"IIT Gandhinagar","doi-asserted-by":"crossref","award":["Post Doc Fellowship"],"award-info":[{"award-number":["Post Doc Fellowship"]}],"id":[{"id":"10.13039\/100018941","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s00607-021-00987-x","type":"journal-article","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T07:04:02Z","timestamp":1629097442000},"page":"657-680","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An approximate marginal spread computation approach for the budgeted influence maximization with delay"],"prefix":"10.1007","volume":"104","author":[{"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mamata","family":"Jenamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilip Kumar","family":"Pratihar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,16]]},"reference":[{"key":"987_CR1","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":"987_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2019.01.070","volume":"125","author":"S Banerjee","year":"2019","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2019) Combim: a community-based solution approach for the budgeted influence maximization problem. Expert Syst Appl 125:1\u201313","journal-title":"Expert Syst Appl"},{"key":"987_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-018-1254-2","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2020) A survey on influence maximization in a social network. Knowle Inf Syst 62:1\u201339","journal-title":"Knowle Inf Syst"},{"issue":"9","key":"987_CR4","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.14778\/3397230.3397244","volume":"13","author":"S Bian","year":"2020","unstructured":"Bian S, Guo Q, Wang S, Yu JX (2020) Efficient algorithms for budgeted influence maximization on massive social networks. Proc VLDB Endow 13(9):1498\u20131510","journal-title":"Proc VLDB Endow"},{"key":"987_CR5","unstructured":"Charikar M, Naamad Y, Wirth A (2016) On approximating target set selection. In: Approximation, randomization, and combinatorial optimization. Algorithms and techniques (APPROX\/RANDOM 2016), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"987_CR6","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":"987_CR7","first-page":"1","volume":"2012","author":"W Chen","year":"2012","unstructured":"Chen W, Lu W, Zhang N (2012) Time-critical influence maximization in social networks with time-delayed diffusion process. AAAI 2012:1\u20135","journal-title":"AAAI"},{"key":"987_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ins.2019.11.029","volume":"514","author":"R De Souza","year":"2020","unstructured":"De Souza R, Figueiredo DR, Rocha AdA, Ziviani A (2020) Efficient network seeding under variable node cost and limited budget for social networks. Inf Sci 514:369\u2013384","journal-title":"Inf Sci"},{"key":"987_CR9","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":"987_CR10","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) 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"},{"issue":"2","key":"987_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2503792.2503797","volume":"42","author":"A Guille","year":"2013","unstructured":"Guille A, Hacid H, Favre C, Zighed DA (2013) Information diffusion in online social networks: a survey. ACM SIGMOD Rec 42(2):17\u201328","journal-title":"ACM SIGMOD Rec"},{"key":"987_CR12","doi-asserted-by":"crossref","unstructured":"Han S, Zhuang F, He Q, Shi Z (2014) Balanced seed selection for budgeted influence maximization in social networks. In: Pacific\u2013Asia conference on knowledge discovery and data mining. Springer, pp 65\u201377","DOI":"10.1007\/978-3-319-06608-0_6"},{"key":"987_CR13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1609\/aaai.v25i1.7838","volume":"11","author":"Q Jiang","year":"2011","unstructured":"Jiang Q, Song G, Cong G, Wang Y, Si W, Xie K (2011) Simulated annealing based influence maximization in social networks. AAAI 11:127\u2013132","journal-title":"AAAI"},{"key":"987_CR14","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":"987_CR15","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":"987_CR16","first-page":"1","volume":"1","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 1:1\u20131","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"987_CR17","unstructured":"Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems, pp 539\u2013547"},{"issue":"1","key":"987_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007a) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2","journal-title":"ACM Trans Knowl Discov Data"},{"key":"987_CR19","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":"987_CR20","doi-asserted-by":"crossref","unstructured":"Li H, Pan L, Wu P (2017) Dominated competitive influence maximization with time-critical and time-delayed diffusion in social networks. J Comput Sci","DOI":"10.1016\/j.jocs.2017.10.015"},{"key":"987_CR21","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.jocs.2017.10.015","volume":"28","author":"H Li","year":"2018","unstructured":"Li H, Pan L, Wu P (2018a) Dominated competitive influence maximization with time-critical and time-delayed diffusion in social networks. J Comput Sci 28:318\u2013327","journal-title":"J Comput Sci"},{"key":"987_CR22","doi-asserted-by":"publisher","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"},{"issue":"8","key":"987_CR23","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1109\/TKDE.2013.106","volume":"26","author":"B Liu","year":"2013","unstructured":"Liu B, Cong G, Zeng Y, Xu D, Chee YM (2013) Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans Knowl Data Eng 26(8):1904\u20131917","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"987_CR24","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1109\/TKDE.2013.106","volume":"26","author":"B Liu","year":"2014","unstructured":"Liu B, Cong G, Zeng Y, Xu D, Chee YM (2014) Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans Knowl Data Eng 26(8):1904\u20131917","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"987_CR25","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.swevo.2018.02.003","volume":"40","author":"A Mohammadi","year":"2018","unstructured":"Mohammadi A, Saraee M (2018) Finding influential users for different time bounds in social networks using multi-objective optimization. Swarm Evol Comput 40:158\u2013165","journal-title":"Swarm Evol Comput"},{"issue":"6","key":"987_CR26","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1177\/0165551515602808","volume":"41","author":"A Mohammadi","year":"2015","unstructured":"Mohammadi A, Saraee M, Mirzaei A (2015) Time-sensitive influence maximization in social networks. J Inf Sci 41(6):765\u2013778","journal-title":"J Inf Sci"},{"issue":"6","key":"987_CR27","doi-asserted-by":"publisher","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"},{"issue":"2","key":"987_CR28","doi-asserted-by":"publisher","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 36(2):14","journal-title":"ACM Trans Inf Syst"},{"key":"987_CR29","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.jocs.2017.11.015","volume":"28","author":"Y Quan","year":"2018","unstructured":"Quan Y, Jia Y, Zhou B, Han W, Li S (2018) Repost prediction incorporating time-sensitive mutual influence in social networks. J Comput Sci 28:217\u2013227","journal-title":"J Comput Sci"},{"key":"987_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00607-019-00778-5","volume":"102","author":"X Rui","year":"2020","unstructured":"Rui X, Yang X, Fan J, Wang Z (2020) A neighbour scale fixed approach for influence maximization in social networks. Computing 102:1\u201323","journal-title":"Computing"},{"key":"987_CR31","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":"987_CR32","doi-asserted-by":"crossref","unstructured":"Swetha G, Datla R (2017) Identification of influential instances in temporal networks. In: 2017 8th international conference on computing, communication and networking technologies (ICCCNT). IEEE, pp 1\u20136","DOI":"10.1109\/ICCCNT.2017.8204015"},{"key":"987_CR33","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TKDE.2017.2787757","volume":"30","author":"J Tang","year":"2017","unstructured":"Tang J, Tang X, Yuan J (2017) Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans Knowl Data Eng 30:1095\u20131108","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"987_CR34","doi-asserted-by":"publisher","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":"987_CR35","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"},{"issue":"1","key":"987_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41019-020-00117-1","volume":"5","author":"S Tian","year":"2020","unstructured":"Tian S, Mo S, Wang L, Peng Z (2020) Deep reinforcement learning-based approach to tackle topic-aware influence maximization. Data Sci Eng 5(1):1\u201311","journal-title":"Data Sci Eng"},{"issue":"3","key":"987_CR37","doi-asserted-by":"publisher","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\u2013576","journal-title":"Data Min Knowl Disc"},{"key":"987_CR38","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ins.2013.09.033","volume":"267","author":"C Wang","year":"2014","unstructured":"Wang C, Deng L, Zhou G, Jiang M (2014) A global optimization algorithm for target set selection problems. Inf Sci 267:101\u2013118","journal-title":"Inf Sci"},{"key":"987_CR39","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.ins.2016.03.029","volume":"355","author":"W Xu","year":"2016","unstructured":"Xu W, Liang W, Lin X, Yu JX (2016) Finding top-k influential users in social networks under the structural diversity model. Inf Sci 355:110\u2013126","journal-title":"Inf Sci"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00987-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-021-00987-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00987-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T12:15:06Z","timestamp":1673093706000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-021-00987-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,16]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["987"],"URL":"https:\/\/doi.org\/10.1007\/s00607-021-00987-x","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,16]]},"assertion":[{"value":"5 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}