{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T15:26:37Z","timestamp":1778685997332,"version":"3.51.4"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"MSIT (Ministry of Science and ICT), South Korea, under the Grant Information Technology Research Center Support Program","award":["IITP-2019-2015-0-00742"],"award-info":[{"award-number":["IITP-2019-2015-0-00742"]}]},{"DOI":"10.13039\/501100010418","name":"IITP","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2908412","type":"journal-article","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T19:16:41Z","timestamp":1554405401000},"page":"44182-44198","source":"Crossref","is-referenced-by-count":19,"title":["Knapsack-Based Reverse Influence Maximization for Target Marketing in Social Networks"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2991-9136","authenticated-orcid":false,"given":"Ashis","family":"Talukder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9054-7557","authenticated-orcid":false,"given":"Md. Golam Rabiul","family":"Alam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen H.","family":"Tran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dusit","family":"Niyato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Choong Seon","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.158"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2809547"},{"key":"ref32","author":"horowitz","year":"1978","journal-title":"Fundamentals of Computer Algorithms"},{"key":"ref31","first-page":"888","article-title":"Threshold estimation models for influence maximization in social network","author":"talukder","year":"2016","journal-title":"Proc Korean Inst Inf Sci Eng (KIISE)"},{"key":"ref30","author":"cohen","year":"2014","journal-title":"Distance-based influence in networks Computation and maximization"},{"key":"ref37","author":"leskovec","year":"2014","journal-title":"SNAP Datasets Stanford large network dataset collection"},{"key":"ref36","author":"hochbaum","year":"1996","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"ref35","first-page":"1","article-title":"Submodular function maximization","volume":"3","author":"krause","year":"2012","journal-title":"Tractability Practical Approaches to Hard Problems"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.5626\/JOK.2018.45.11.1203"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.145"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339731"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.40"},{"key":"ref17","first-page":"1214","article-title":"Rumors in the social network: Finding the offenders using influence maximization","author":"talukder","year":"2015","journal-title":"Proc Korea Comput Congr (KCC)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/APNOMS.2017.8094146"},{"key":"ref28","author":"du","year":"2013","journal-title":"Budgeted influence maximization for multiple products"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2866981"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524470"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2764001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124368"},{"key":"ref29","first-page":"37","article-title":"Influence maximization with novelty decay in social networks","author":"feng","year":"2014","journal-title":"Proc AAAI"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.122"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1086\/209118"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2605009"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.33"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.02.007"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2018.8406245"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718518"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"ref26","author":"rodriguez","year":"2012","journal-title":"Influence maximization in continuous time diffusion networks"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2764750"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08681423.pdf?arnumber=8681423","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:40Z","timestamp":1628624440000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8681423\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2908412","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}