{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T06:11:55Z","timestamp":1767679915233,"version":"3.48.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T00:00:00Z","timestamp":1767657600000},"content-version":"vor","delay-in-days":35,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-025-01530-y","type":"journal-article","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T20:37:09Z","timestamp":1764707829000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cost minimizing heuristic based seed marketing in social networks"],"prefix":"10.1007","volume":"16","author":[{"given":"Ashis","family":"Talukder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhan","family":"Faruk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Golam Rabiul","family":"Alam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santus Kumar","family":"Deb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"1530_CR1","doi-asserted-by":"crossref","unstructured":"Bhagat S, Goyal A, Lakshmanan LV (2012) Maximizing product adoption in social networks. In Proceedings of the fifth ACM international conference on Web search and data mining, 603\u2013612 (ACM)","DOI":"10.1145\/2124295.2124368"},{"key":"1530_CR2","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal D, El\u00a0Abbadi A (2011) Limiting the spread of misinformation in social networks. In Proceedings of the 20th international conference on World wide web, 665\u2013674 (ACM)","DOI":"10.1145\/1963405.1963499"},{"key":"1530_CR3","unstructured":"Burke K (2003) As consumer attitudes shift, so must marketing strategies. In Twelfth ACM conference on electronic commerce (EC\u201911), 157\u2013166"},{"key":"1530_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"A Caprara","year":"2000","unstructured":"Caprara A, Kellerer H, Pferschy U, Pisinger D (2000) Approximation algorithms for knapsack problems with cardinality constraints. Eur J Oper Res 123:333\u2013345","journal-title":"Eur J Oper Res"},{"key":"1530_CR5","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri C, Khanna S (2005) A polynomial time approximation scheme for the multiple knapsack problem. SIAM J Comput 35:713\u2013728","journal-title":"SIAM J Comput"},{"key":"1530_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, 199\u2013208 (ACM)","DOI":"10.1145\/1557019.1557047"},{"key":"1530_CR7","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, 1029\u20131038 (ACM)","DOI":"10.1145\/1835804.1835934"},{"key":"1530_CR8","doi-asserted-by":"publisher","first-page":"2210","DOI":"10.1109\/TCSS.2023.3272331","volume":"11","author":"T Chen","year":"2024","unstructured":"Chen T, Yan S, Guo J, Wu W (2024) Touplegdd: a fine-designed solution of influence maximization by deep reinforcement learning. IEEE Trans Comput Soc Syst 11:2210\u20132221. https:\/\/doi.org\/10.1109\/TCSS.2023.3272331","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1530_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10100-022-00807-3","volume":"31","author":"EJ Cs\u00f3k\u00e1s","year":"2023","unstructured":"Cs\u00f3k\u00e1s EJ, Vink\u00f3 T (2023) An exact method for influence maximization based on deterministic linear threshold model. CEJOR 31:269\u2013286","journal-title":"CEJOR"},{"key":"1530_CR10","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, 57\u201366 (ACM)","DOI":"10.1145\/502512.502525"},{"key":"1530_CR11","unstructured":"Du N, Liang Y, Balcan MF, Song L (2013) Budgeted influence maximization for multiple products. arXiv preprint arXiv:1312.2164"},{"key":"1530_CR12","doi-asserted-by":"crossref","unstructured":"Goyal A, Lakshmanan LV (2012) Recmax: Exploiting recommender systems for fun and profit. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, 1294\u20131302 (ACM)","DOI":"10.1145\/2339530.2339731"},{"key":"1530_CR13","doi-asserted-by":"crossref","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, 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"1530_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.ins.2019.07.043","volume":"503","author":"E G\u00fcney","year":"2019","unstructured":"G\u00fcney E (2019) An efficient linear programming based method for the influence maximization problem in social networks. Inf Sci 503:589\u2013605","journal-title":"Inf Sci"},{"key":"1530_CR15","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1109\/TNET.2023.3321870","volume":"32","author":"J Guo","year":"2024","unstructured":"Guo J, Ni Q, Wu W, Du D-Z (2024) Composite community-aware diversified influence maximization with efficient approximation. IEEE\/ACM Trans Netw 32:1584\u20131599. https:\/\/doi.org\/10.1109\/TNET.2023.3321870","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1530_CR16","unstructured":"Han K, He Y, Tang S, Huang H, Xu C (2017) Cost-effective seed selection in online social networks. arXiv preprint arXiv:1711.10665"},{"key":"1530_CR17","volume-title":"Approximation algorithms for NP-hard problems","author":"DS Hochbaum","year":"1996","unstructured":"Hochbaum DS (1996) Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, MA, USA"},{"key":"1530_CR18","unstructured":"Horowitz E, Sahni S (2012) Fundamentals of computer algorithms (Computer Science Press, New York) 2nd edn"},{"key":"1530_CR19","first-page":"1793","volume":"3","author":"T Jayalakshmi","year":"2011","unstructured":"Jayalakshmi T, Santhakumaran A (2011) Statistical normalization and back propagation for classification. Int J Comput Theory Eng 3:1793\u20138201","journal-title":"Int J Comput Theory Eng"},{"key":"1530_CR20","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) Irie: Scalable and robust influence maximization in social networks. In Data Mining (ICDM), 2012 IEEE 12th international conference on, 918\u2013923 (IEEE)","DOI":"10.1109\/ICDM.2012.79"},{"key":"1530_CR21","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, 137\u2013146 (ACM)","DOI":"10.1145\/956750.956769"},{"key":"1530_CR22","first-page":"3383","volume":"26","author":"ME Keskin","year":"2018","unstructured":"Keskin ME, G\u00fcler MG (2018) Influence maximization in social networks: an integer programming approach. Turk J Electr Eng Comput Sci 26:3383\u20133396","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"1530_CR23","doi-asserted-by":"publisher","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:39\u201345","journal-title":"Inf Process Lett"},{"key":"1530_CR24","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TKDE.2014.2330833","volume":"27","author":"J-R Lee","year":"2015","unstructured":"Lee J-R, Chung C-W (2015) A query approach for influence maximization on specific users in social networks. IEEE Trans Knowl Data Eng 27:340\u2013353","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1530_CR25","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"1530_CR26","doi-asserted-by":"crossref","unstructured":"Leskovec J et\u00a0al (2007) Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, 420\u2013429 (ACM)","DOI":"10.1145\/1281192.1281239"},{"key":"1530_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3604559","volume":"17","author":"Y Li","year":"2023","unstructured":"Li Y, Gao H, Gao Y, Guo J, Wu W (2023) A survey on influence maximization: from an ml-based combinatorial optimization. ACM Trans Knowl Discov Data 17:1\u201350. https:\/\/doi.org\/10.1145\/3604559","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1530_CR28","doi-asserted-by":"crossref","unstructured":"Lu W, Lakshmanan LV (2012) Profit maximization over social networks. In Data Mining (ICDM), 2012 IEEE 12th international conference on, 479\u2013488 (IEEE)","DOI":"10.1109\/ICDM.2012.145"},{"key":"1530_CR29","doi-asserted-by":"crossref","unstructured":"Mei Y, Zhao W, Yang J (2017) Influence maximization on twitter: a mechanism for effective marketing campaign. In Communications (ICC), 2017 IEEE International Conference on, 1\u20136 (IEEE)","DOI":"10.1109\/ICC.2017.7996805"},{"key":"1530_CR30","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-i. Math Program 14:265\u2013294","journal-title":"Math Program"},{"key":"1530_CR31","doi-asserted-by":"crossref","unstructured":"Nguyen DT, Das S, Thai MT (2013) Influence maximization in multiple online social networks. In Global Communications Conference (GLOBECOM), 2013 IEEE, 3060\u20133065 (IEEE)","DOI":"10.1109\/GLOCOM.2013.6831541"},{"key":"1530_CR32","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In Proceedings of the 2016 international conference on management of data, 695\u2013710 (ACM)","DOI":"10.1145\/2882903.2915207"},{"key":"1530_CR33","doi-asserted-by":"publisher","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 (TON) 25:2419\u20132429","journal-title":"IEEE\/ACM Trans Netw (TON)"},{"key":"1530_CR34","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3390\/fi11050112","volume":"11","author":"X Rao","year":"2019","unstructured":"Rao X, Zhao J, Chen Z, Lin F (2019) Substitute seed nodes mining algorithms for influence maximization in multi-social networks. Future Internet 11:112","journal-title":"Future Internet"},{"key":"1530_CR35","doi-asserted-by":"crossref","unstructured":"Raya M, Papadimitratos P, Gligor VD, Hubaux JP (2008) On data-centric trust establishment in ephemeral ad hoc networks. In INFOCOM 2008. The 27th conference on computer communications. IEEE, 1238\u20131246 (IEEE)","DOI":"10.1109\/INFOCOM.2008.180"},{"key":"1530_CR36","unstructured":"Schroeder S (2010) Social networks play a major part in how we get news"},{"key":"1530_CR44","doi-asserted-by":"crossref","unstructured":"Talukder A, Hong CS (2017) Active reverse path based reverse influence maximization in social networks. In Korea Software Congress (KSC 2017), 1203\u20131205 (KIISE)","DOI":"10.5626\/JOK.2018.45.11.1203"},{"key":"1530_CR45","unstructured":"Talukder A, Hong CS (2018a) A heuristic approach for viral marketing cost optimization in social networks. In Korea Software Congress (KSC 2018), 1082\u20131084 (KIISE)"},{"key":"1530_CR46","unstructured":"Talukder A, Hong CS (2018b) Epidemiological reverse influence maximization in social networks with negative influencing. In Korean Computer Congress (KCC 2018), 1277\u20131279 (KIISE)"},{"key":"1530_CR47","unstructured":"Talukder A, Hong CS (2019a) A susceptible-infection-based greedy model for mining cost-effective seeds in social networks. In Korean Computer Congress (KCC 2019), 1533\u20131535 (KIISE)"},{"key":"1530_CR48","doi-asserted-by":"crossref","unstructured":"Talukder A, Hong CS (2019b) Knapsack-based reverse influence maximization for target marketing in social networks. In Proceedings of the 34th ACM\/SIGAPP symposium on applied computing, SAC \u201919, 2128\u20132130, (ACM, New York, NY, USA)","DOI":"10.1145\/3297280.3297621"},{"key":"1530_CR42","unstructured":"Talukder A et\u00a0al (2015) Rumors in the social network: finding the offenders using influence maximization. In Korean Computer Congress (KCC 2015), 1214\u20131216 (KIISE)"},{"key":"1530_CR43","unstructured":"Talukder A et\u00a0al (2016a) The grim: target marketing in social network. In The international symposium on perception, action, and cognitive systems (PACS 2016), 24\u201325 (KIISE)"},{"key":"1530_CR37","unstructured":"Talukder A et\u00a0al (2016b) Threshold estimation models for influence maximization in social network. In Korean Institute of Information Scientists and Engineers (KIISE), 888\u2013890 (KIISE)"},{"key":"1530_CR41","doi-asserted-by":"crossref","unstructured":"Talukder A et\u00a0al ( 2017) An approach of cost optimized influence maximization in social networks. In 2017 19th Asia-Pacific network operations and management symposium (APNOMS), 354\u2013357 (IEEE)","DOI":"10.1109\/APNOMS.2017.8094146"},{"key":"1530_CR38","first-page":"1203","volume":"45","author":"A Talukder","year":"2018","unstructured":"Talukder A, Bairagi AK, Kim DH, Hong CS (2018a) Reverse path activation-based reverse influence maximization in social networks. J Korean Inst Inf Sci Eng (JOK) 45:1203\u20131209","journal-title":"J Korean Inst Inf Sci Eng (JOK)"},{"key":"1530_CR40","doi-asserted-by":"crossref","unstructured":"Talukder A, Alam MGR, Tran NH, Hong CS (2018b) A cost optimized reverse influence maximization in social networks. In 2018 IEEE\/IFIP network operations and management symposium (NOMS 2018), 1\u20139 (IEEE)","DOI":"10.1109\/NOMS.2018.8406245"},{"key":"1530_CR39","doi-asserted-by":"publisher","first-page":"44182","DOI":"10.1109\/ACCESS.2019.2908412","volume":"7","author":"A Talukder","year":"2019","unstructured":"Talukder A, Alam MGR, Tran NH, Niyato D, Hong CS (2019a) Knapsack-based reverse influence maximization for target marketing in social networks. IEEE Access 7:44182\u201344198","journal-title":"IEEE Access"},{"key":"1530_CR49","doi-asserted-by":"crossref","unstructured":"Talukder A, Kim DH, Hong CS (2019b) A heuristic mixed model for viral marketing cost minimization in social networks. In IEEE international conference on information networking (ICOIN 2019), 141\u2013146 (IEEE)","DOI":"10.1109\/ICOIN.2019.8718136"},{"key":"1530_CR50","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/TCSS.2018.2818661","volume":"5","author":"G Tong","year":"2018","unstructured":"Tong G, Wu W, Du D-Z (2018) Distributed rumor blocking with multiple positive cascades. IEEE Trans Comput Soc Syst 5:468\u2013480","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1530_CR51","unstructured":"Wagner K, Molla R. Facebook\u2019s first 15 years were defined by user growth: from dorm room to global dominance, facebook\u2019s path to 2.3 billion users. Accessed 30 May 2019"},{"key":"1530_CR52","first-page":"26","volume":"85","author":"E Ward","year":"2000","unstructured":"Ward E (2000) Viral marketing involves serendipity, not planning. Advert Age\u2019s Bus Market 85:26\u201326","journal-title":"Advert Age\u2019s Bus Market"},{"key":"1530_CR53","first-page":"232","volume":"70","author":"RF Wilson","year":"2000","unstructured":"Wilson RF (2000) The six simple principles of viral marketing. Web Market Today 70:232","journal-title":"Web Market Today"},{"key":"1530_CR54","doi-asserted-by":"publisher","first-page":"13745","DOI":"10.1109\/ACCESS.2019.2894073","volume":"7","author":"W Yang","year":"2019","unstructured":"Yang W, Brenner L, Giua A (2019) Influence maximization in independent cascade networks based on activation probability computation. IEEE Access 7:13745\u201313757","journal-title":"IEEE Access"},{"key":"1530_CR55","doi-asserted-by":"crossref","unstructured":"Zhang H, Dinh TN, Thai MT (2013) Maximizing the spread of positive influence in online social networks. In Distributed computing systems (ICDCS), 2013 IEEE 33rd international conference on, 317\u2013326 (IEEE)","DOI":"10.1109\/ICDCS.2013.37"},{"key":"1530_CR56","doi-asserted-by":"crossref","unstructured":"Zhang H, Zhang H, Kuhnle A, Thai MT (2016) Profit maximization for multiple products in online social networks. In Computer communications, IEEE INFOCOM 2016-The 35th annual IEEE international conference on, 1\u20139 (IEEE)","DOI":"10.1109\/INFOCOM.2016.7524470"},{"key":"1530_CR57","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.future.2012.06.011","volume":"31","author":"J Zhou","year":"2014","unstructured":"Zhou J, Zhang Y, Cheng J (2014) Preference-based mining of top-k influential nodes in social networks. Futur Gener Comput Syst 31:40\u201347","journal-title":"Futur Gener Comput Syst"},{"key":"1530_CR58","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou C, Zhang P, Zang W, Guo L (2015) On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans Knowl Data Eng 27:2770\u20132783","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1530_CR59","doi-asserted-by":"crossref","unstructured":"Zhu Y, et\u00a0al (2013) Influence and profit: Two sides of the coin. In 2013 IEEE 13th international conference on data mining, 1301\u20131306 (IEEE)","DOI":"10.1109\/ICDM.2013.40"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01530-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-025-01530-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01530-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T06:07:41Z","timestamp":1767679661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-025-01530-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"references-count":59,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["1530"],"URL":"https:\/\/doi.org\/10.1007\/s13278-025-01530-y","relation":{},"ISSN":["1869-5469"],"issn-type":[{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"26 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"6"}}