{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T07:21:10Z","timestamp":1775460070613,"version":"3.50.1"},"reference-count":69,"publisher":"Elsevier BV","issue":"21","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T00:00:00Z","timestamp":1730246400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cell.com","elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Heliyon"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1016\/j.heliyon.2024.e40031","type":"journal-article","created":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T12:54:16Z","timestamp":1730465656000},"page":"e40031","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Budget-aware local influence iterative algorithm for efficient influence maximization in social networks"],"prefix":"10.1016","volume":"10","author":[{"given":"Lingfei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingxin","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaguang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5939-9795","authenticated-orcid":false,"given":"Amir M.","family":"Fathollahi-Fard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.heliyon.2024.e40031_bib1","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1287\/mnsc.2019.3564","article-title":"Competition for attention in online social networks: implications for seeding strategies","volume":"67","author":"Gelper","year":"2021","journal-title":"Manag. Sci."},{"issue":"3","key":"10.1016\/j.heliyon.2024.e40031_bib2","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1287\/isre.2016.0679","article-title":"Understanding voluntary knowledge provision and content contribution through a social-media-based prediction market: a field experiment","volume":"28","author":"Qiu","year":"2017","journal-title":"Inf. Syst. Res."},{"issue":"3","key":"10.1016\/j.heliyon.2024.e40031_bib3","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1177\/00222437221116034","article-title":"Optimal microtargeting of advertising","volume":"60","author":"Danaher","year":"2023","journal-title":"J. Market. Res."},{"issue":"5","key":"10.1016\/j.heliyon.2024.e40031_bib4","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1080\/00913367.2021.1980470","article-title":"David and goliath: when and why micro-influencers are more persuasive than mega-influencers","volume":"50","author":"Park","year":"2021","journal-title":"J. Advert."},{"key":"10.1016\/j.heliyon.2024.e40031_bib5","series-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"issue":"9","key":"10.1016\/j.heliyon.2024.e40031_bib6","doi-asserted-by":"crossref","first-page":"5766","DOI":"10.1073\/pnas.082090499","article-title":"A simple model of global cascades on random networks","volume":"99","author":"Watts","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"6","key":"10.1016\/j.heliyon.2024.e40031_bib7","doi-asserted-by":"crossref","DOI":"10.1145\/3573011","article-title":"Triadic closure sensitive influence maximization","volume":"17","author":"Yang","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.heliyon.2024.e40031_bib8","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119105","article-title":"A fast module identification and filtering approach for influence maximization problem in social networks","volume":"640","author":"Beni","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib9","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.106942","article-title":"Efficient parallel computing on the game theory-aware robust influence maximization problem","volume":"220","author":"Gong","year":"2021","journal-title":"Knowl. Base Syst."},{"key":"10.1016\/j.heliyon.2024.e40031_bib10","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2023.126936","article-title":"Influence maximization algorithm based on group trust and local topology structure","volume":"564","author":"Guo","year":"2024","journal-title":"Neurocomputing"},{"key":"10.1016\/j.heliyon.2024.e40031_bib11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ins.2020.01.040","article-title":"Targeted influence maximization under a multifactor-based information propagation model","volume":"519","author":"Li","year":"2020","journal-title":"Inf. Sci."},{"issue":"3","key":"10.1016\/j.heliyon.2024.e40031_bib12","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10115-013-0646-6","article-title":"Topic-aware social influence propagation models","volume":"37","author":"Barbieri","year":"2013","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.heliyon.2024.e40031_bib13","article-title":"Complementary influence maximization under comparative linear threshold model","volume":"238","author":"Yang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.heliyon.2024.e40031_bib14","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ins.2020.09.002","article-title":"Maximizing positive influence in competitive social networks: a trust-based solution","volume":"546","author":"Wang","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib15","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.106600","article-title":"Competitive and complementary influence maximization in social network: a follower's perspective","volume":"213","author":"Huang","year":"2021","journal-title":"Knowl. Base Syst."},{"key":"10.1016\/j.heliyon.2024.e40031_bib16","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107497","article-title":"Competitive influence maximization considering inactive nodes and community homophily","volume":"233","author":"Xie","year":"2021","journal-title":"Knowl. Base Syst."},{"key":"10.1016\/j.heliyon.2024.e40031_bib17","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107451","article-title":"Node deletion-based algorithm for blocking maximizing on negative influence from uncertain sources","volume":"231","author":"Ju","year":"2021","journal-title":"Knowl. Base Syst."},{"key":"10.1016\/j.heliyon.2024.e40031_bib18","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119174","article-title":"Fuzzy sign-aware diffusion models for influence maximization in signed social networks","volume":"645","author":"Mohammadi","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib19","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.ins.2021.04.061","article-title":"Influence maximization algorithm based on Gaussian propagation model","volume":"568","author":"Li","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib20","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ins.2022.11.163","article-title":"Hierarchical attention neural network for information cascade prediction","volume":"622","author":"Zhong","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib21","series-title":"Proceedings of the 20th International Conference Companion on World Wide Web","article-title":"Celf++: optimizing the greedy algorithm for influence maximization in social networks","author":"Goyal","year":"2011"},{"key":"10.1016\/j.heliyon.2024.e40031_bib22","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","article-title":"Maximizing social influence in nearly optimal time","author":"Borgs","year":"2014"},{"key":"10.1016\/j.heliyon.2024.e40031_bib23","series-title":"Influence Maximization in Near-Linear Time: A Martingale Approach","author":"Tang","year":"2015"},{"issue":"99","key":"10.1016\/j.heliyon.2024.e40031_bib24","article-title":"Bring order into the samples: a novel scalable method for influence maximization","author":"Wang","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.heliyon.2024.e40031_bib25","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/j.ins.2020.08.093","article-title":"Attribute based diversification of seeds for targeted influence maximization","volume":"546","author":"Cali\u00f2","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib26","series-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","article-title":"Efficient influence maximization in social networks","author":"Chen","year":"2009"},{"key":"10.1016\/j.heliyon.2024.e40031_bib27","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121067","article-title":"Identifying vital nodes through augmented random walks on higher-order networks","volume":"679","author":"Zeng","year":"2024","journal-title":"Inf. Sci."},{"issue":"11","key":"10.1016\/j.heliyon.2024.e40031_bib28","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Kitsak","year":"2010","journal-title":"Nat. Phys."},{"issue":"2","key":"10.1016\/j.heliyon.2024.e40031_bib29","article-title":"Accurate ranking of influential spreaders in networks based on dynamically asymmetric link weights","volume":"96","author":"Liu","year":"2017","journal-title":"Phys. Rev."},{"key":"10.1016\/j.heliyon.2024.e40031_bib30","article-title":"Improving the accuracy of the k-shell method by removing redundant links: from a perspective of spreading dynamics","volume":"5","author":"Liu","year":"2015","journal-title":"Sci. Rep."},{"key":"10.1016\/j.heliyon.2024.e40031_bib31","doi-asserted-by":"crossref","DOI":"10.1089\/big.2020.0259","article-title":"Identifying influential nodes using a shell-based ranking and filtering method in social networks","volume":"9","author":"Ahmadi Beni","year":"2021","journal-title":"Big Data"},{"key":"10.1016\/j.heliyon.2024.e40031_bib32","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2021.108130","article-title":"Community-based k-shell decomposition for identifying influential spreaders","volume":"120","author":"Sun","year":"2021","journal-title":"Pattern Recogn."},{"key":"10.1016\/j.heliyon.2024.e40031_bib33","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114207","article-title":"A dynamic algorithm based on cohesive entropy for influence maximization in social networks","volume":"169","author":"Li","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.heliyon.2024.e40031_bib34","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118869","article-title":"FIP: a fast overlapping community-based influence maximization algorithm using probability coefficient of global diffusion in social networks","volume":"213","author":"Bouyer","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.heliyon.2024.e40031_bib35","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2021.126258","article-title":"LKG: a fast scalable community-based approach for influence maximization problem in social networks","volume":"582","author":"Samir","year":"2021","journal-title":"Phys. Stat. Mech. Appl."},{"key":"10.1016\/j.heliyon.2024.e40031_bib36","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2022.127314","article-title":"Influence maximization in social networks using effective community detection","volume":"598","author":"Kazemzadeh","year":"2022","journal-title":"Phys. Stat. Mech. Appl."},{"key":"10.1016\/j.heliyon.2024.e40031_bib37","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.ins.2022.07.103","article-title":"CBIM: community-based influence maximization in multilayer networks","volume":"609","author":"Venkatakrishna Rao","year":"2022","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib38","series-title":"Applications of Evolutionary Computation","article-title":"Influence maximization in social networks with genetic algorithms","author":"Bucur","year":"2016"},{"key":"10.1016\/j.heliyon.2024.e40031_bib39","series-title":"2015 IEEE International Conference on Systems, Man, and Cybernetics","article-title":"A genetic NewGreedy algorithm for influence maximization in social network","author":"Tsai","year":"2015"},{"key":"10.1016\/j.heliyon.2024.e40031_bib40","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ins.2020.12.048","article-title":"An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks","volume":"556","author":"Biswas","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib41","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118770","article-title":"Influence maximization in social networks using transfer learning via graph-based LSTM","volume":"212","author":"Kumar","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.heliyon.2024.e40031_bib42","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117289","article-title":"MAHE-IM: multiple aggregation of heterogeneous relation embedding for influence maximization on heterogeneous information network","volume":"202","author":"Li","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.heliyon.2024.e40031_bib43","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.112905","article-title":"Influence maximization across heterogeneous interconnected networks based on deep learning","volume":"140","author":"Keikha","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.heliyon.2024.e40031_bib44","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1016\/j.ins.2022.06.075","article-title":"Influence maximization in social networks using graph embedding and graph neural network","volume":"607","author":"Kumar","year":"2022","journal-title":"Inf. Sci."},{"issue":"9","key":"10.1016\/j.heliyon.2024.e40031_bib45","doi-asserted-by":"crossref","DOI":"10.1145\/3604559","article-title":"A survey on influence maximization: from an ML-based combinatorial optimization","volume":"17","author":"Li","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"7","key":"10.1016\/j.heliyon.2024.e40031_bib46","doi-asserted-by":"crossref","DOI":"10.1145\/3654673","article-title":"Attacking social media via behavior poisoning","volume":"18","author":"Wu","year":"2024","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"7","key":"10.1016\/j.heliyon.2024.e40031_bib47","doi-asserted-by":"crossref","DOI":"10.1145\/3587100","article-title":"Robust influence maximization under both aleatory and epistemic uncertainty","volume":"17","author":"Biswas","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.heliyon.2024.e40031_bib48","doi-asserted-by":"crossref","DOI":"10.1016\/j.datak.2023.102276","article-title":"A bitwise approach on influence overload problem","volume":"150","author":"Lee","year":"2024","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.heliyon.2024.e40031_bib49","series-title":"2024 IEEE 40th International Conference on Data Engineering (ICDE)","article-title":"BIM: improving graph neural networks with balanced influence maximization","author":"Zhang","year":"2024"},{"issue":"3","key":"10.1016\/j.heliyon.2024.e40031_bib50","doi-asserted-by":"crossref","first-page":"3148","DOI":"10.1109\/TNSE.2024.3362903","article-title":"IM-META: influence maximization using node metadata in networks with unknown topology","volume":"11","author":"Tran","year":"2024","journal-title":"IEEE Transactions on Network Science and Engineering"},{"issue":"6","key":"10.1016\/j.heliyon.2024.e40031_bib51","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","article-title":"On budgeted influence maximization in social networks","volume":"31","author":"Nguyen","year":"2013","journal-title":"IEEE J. Sel. Area. Commun."},{"issue":"8","key":"10.1016\/j.heliyon.2024.e40031_bib52","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1080\/01605682.2018.1489343","article-title":"How to maximize advertising performance in online social networks","volume":"70","author":"Liu","year":"2019","journal-title":"J. Oper. Res. Soc."},{"issue":"9","key":"10.1016\/j.heliyon.2024.e40031_bib53","doi-asserted-by":"crossref","first-page":"1498","DOI":"10.14778\/3397230.3397244","article-title":"Efficient algorithms for budgeted influence maximization on massive social networks","volume":"13","author":"Bian","year":"2020","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"10.1016\/j.heliyon.2024.e40031_bib54","first-page":"817","article-title":"On the optimal solution of budgeted influence maximization problem in social networks","volume":"19","author":"G\u00fcney","year":"2019","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.heliyon.2024.e40031_bib55","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1109\/TNSE.2021.3064828","article-title":"A local-global influence indicator based constrained evolutionary algorithm for budgeted influence maximization in social networks","volume":"8","author":"Zhang","year":"2021","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"10.1016\/j.heliyon.2024.e40031_bib56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.eswa.2019.01.070","article-title":"ComBIM: a community-based solution approach for the budgeted influence maximization problem","volume":"125","author":"Banerjee","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.heliyon.2024.e40031_bib57","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ins.2019.11.029","article-title":"Efficient network seeding under variable node cost and limited budget for social networks","volume":"514","author":"de Souza","year":"2020","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib58","doi-asserted-by":"crossref","first-page":"2320","DOI":"10.1109\/ACCESS.2017.2782814","article-title":"Influence maximization-cost minimization in social networks based on a multiobjective discrete particle swarm optimization algorithm","volume":"6","author":"Yang","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.heliyon.2024.e40031_bib59","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.neucom.2019.02.010","article-title":"Post and repost: a holistic view of budgeted influence maximization","volume":"338","author":"Shi","year":"2019","journal-title":"Neurocomputing"},{"key":"10.1016\/j.heliyon.2024.e40031_bib60","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114346","article-title":"Earned benefit maximization in social networks under budget constraint","volume":"169","author":"Banerjee","year":"2021","journal-title":"Expert Syst. Appl."},{"issue":"37","key":"10.1016\/j.heliyon.2024.e40031_bib61","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0065-2601(05)37006-7","article-title":"Says who? Epistemic authority effects in social judgment","volume":"37","author":"Kruglanski","year":"2005","journal-title":"Adv. Exp. Soc. Psychol."},{"key":"10.1016\/j.heliyon.2024.e40031_bib62","doi-asserted-by":"crossref","DOI":"10.1016\/j.chb.2023.108055","article-title":"Determinants of public emergency information dissemination on social networks: a meta-analysis","volume":"152","author":"Li","year":"2024","journal-title":"Comput. Hum. Behav."},{"key":"10.1016\/j.heliyon.2024.e40031_bib63","series-title":"Communication and Persuasion","article-title":"Communication and persuasion","author":"Hovland","year":"1953"},{"key":"10.1016\/j.heliyon.2024.e40031_bib64","series-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","article-title":"Social influence analysis in large-scale networks","author":"Tang","year":"2009"},{"key":"10.1016\/j.heliyon.2024.e40031_bib65","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2021.126480","article-title":"An improved influence maximization method for social networks based on genetic algorithm","volume":"586","author":"Jabari Lotf","year":"2022","journal-title":"Phys. Stat. Mech. Appl."},{"issue":"8","key":"10.1016\/j.heliyon.2024.e40031_bib66","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3594544","article-title":"Community-based influence maximization using network embedding in dynamic heterogeneous social networks","volume":"17","author":"Qin","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"3","key":"10.1016\/j.heliyon.2024.e40031_bib67","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/TCSS.2022.3164667","article-title":"PIANO: influence maximization meets deep reinforcement learning","volume":"10","author":"Li","year":"2023","journal-title":"IEEE Transac. Comput. Soc. Syst."},{"key":"10.1016\/j.heliyon.2024.e40031_bib68","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.ins.2022.06.052","article-title":"Multi-objective scheduling of priority-based rescue vehicles to extinguish forest fires using a multi-objective discrete gravitational search algorithm","volume":"608","author":"Tian","year":"2022","journal-title":"Inf. Sci."},{"key":"10.1016\/j.heliyon.2024.e40031_bib69","article-title":"A distributed permutation flow-shop considering sustainability criteria and real-time scheduling","volume":"39","author":"Fathollahi-Fard","year":"2024","journal-title":"J. Ind. Inf. Integr."}],"container-title":["Heliyon"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2405844024160628?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2405844024160628?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T06:35:31Z","timestamp":1775457331000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2405844024160628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":69,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["S2405844024160628"],"URL":"https:\/\/doi.org\/10.1016\/j.heliyon.2024.e40031","relation":{},"ISSN":["2405-8440"],"issn-type":[{"value":"2405-8440","type":"print"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Budget-aware local influence iterative algorithm for efficient influence maximization in social networks","name":"articletitle","label":"Article Title"},{"value":"Heliyon","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.heliyon.2024.e40031","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"e40031"}}