{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:34:32Z","timestamp":1777491272683,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10878-019-00439-5","type":"journal-article","created":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T14:02:57Z","timestamp":1564063377000},"page":"1101-1127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Minimum budget for misinformation blocking in online social networks"],"prefix":"10.1007","volume":"38","author":[{"given":"Canh V.","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quat V.","family":"Phu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huan X.","family":"Hoang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0503-2012","authenticated-orcid":false,"given":"My T.","family":"Thai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"439_CR1","unstructured":"Allcott H, Gentzkow M (2016) Social media and fake news in the 2016 election. Stanford Web \n                    https:\/\/web.stanford.edu\/~gentzkow\/research\/fakenews.pdf\n                    \n                  . Accessed 21 July 2019"},{"issue":"1\u20133","key":"439_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro Y, Hassin R, Iwama K (2002) Complexity of finding dense subgraphs. Discrete Appl Math 121(1\u20133):15\u201326. \n                    https:\/\/doi.org\/10.1016\/S0166-218X(01)00243-8","journal-title":"Discrete Appl Math"},{"key":"439_CR3","doi-asserted-by":"publisher","unstructured":"Budak C, Agrawal D, El Abbadi A (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20th international conference on world wide web, WWW 2011, Hyderabad, India, March 28\u2013April 1, 2011, pp 665\u2013674. \n                    https:\/\/doi.org\/10.1145\/1963405.1963499","DOI":"10.1145\/1963405.1963499"},{"key":"439_CR4","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, Washington, DC, USA, July 25\u201328, 2010, pp 1029\u20131038. \n                    https:\/\/doi.org\/10.1145\/1835804.1835934","DOI":"10.1145\/1835804.1835934"},{"key":"439_CR5","doi-asserted-by":"publisher","unstructured":"Chen W, Yuan Y, Zhang L (2010b) Scalable influence maximization in social networks under the linear threshold model. In: ICDM 2010, The 10th IEEE international conference on data mining, Sydney, Australia, 14\u201317 December 2010, pp 88\u201397. \n                    https:\/\/doi.org\/10.1109\/ICDM.2010.118","DOI":"10.1109\/ICDM.2010.118"},{"key":"439_CR6","doi-asserted-by":"publisher","unstructured":"Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, San Diego, CA, USA, August 21\u201324, 2011, pp 1082\u20131090. \n                    https:\/\/doi.org\/10.1145\/2020408.2020579","DOI":"10.1145\/2020408.2020579"},{"key":"439_CR7","unstructured":"Domm P (2013) False rumor of explosion at white house causes stocks to briefly plunge; AP confirms its Twitter feed was hacked CNBC. CNBC \n                    http:\/\/www.cnbc.com\/id\/100646197\n                    \n                  . Accessed 21 July 2019"},{"key":"439_CR8","unstructured":"Farajtabar M, Yang J, Ye X, Xu H, Trivedi R, Khalil EB, Li S, Song L, Zha H (2017) Fake news mitigation via point process based intervention. In: Proceedings of the 34th international conference on machine learning, ICML 2017, Sydney, NSW, Australia, 6\u201311 August 2017, pp 1097\u20131106. \n                    http:\/\/proceedings.mlr.press\/v70\/farajtabar17a.html"},{"issue":"2","key":"439_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s13278-012-0062-z","volume":"3","author":"A Goyal","year":"2013","unstructured":"Goyal A, Bonchi F, Lakshmanan LVS, Venkatasubramanian S (2013) On minimizing budget and time in influence propagation over social networks. Soc Netw Anal Min 3(2):179\u2013192. \n                    https:\/\/doi.org\/10.1007\/s13278-012-0062-z","journal-title":"Soc Netw Anal Min"},{"key":"439_CR10","doi-asserted-by":"publisher","unstructured":"He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the Twelfth SIAM international conference on data mining, Anaheim, California, USA, April 26\u201328, 2012, pp 463\u2013474. \n                    https:\/\/doi.org\/10.1137\/1.9781611972825.40","DOI":"10.1137\/1.9781611972825.40"},{"key":"439_CR11","doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg JM, 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, Washington, DC, USA, August 24\u201327, 2003, pp 137\u2013146. \n                    https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"439_CR12","doi-asserted-by":"publisher","unstructured":"Khalil EB, Dilkina BN, Song L (2014) Scalable diffusion-aware optimization of network topology. In: The 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201914, New York, NY, USA, August 24\u201327, 2014, pp 1226\u20131235. \n                    https:\/\/doi.org\/10.1145\/2623330.2623704","DOI":"10.1145\/2623330.2623704"},{"key":"439_CR13","doi-asserted-by":"publisher","unstructured":"Kumar S, Spezzano F, Subrahmanian VS, Faloutsos C (2016) Edge weight prediction in weighted signed networks. In: IEEE 16th international conference on data mining, ICDM 2016, December 12\u201315, 2016, Barcelona, Spain, pp 221\u2013230. \n                    https:\/\/doi.org\/10.1109\/ICDM.2016.0033","DOI":"10.1109\/ICDM.2016.0033"},{"key":"439_CR14","doi-asserted-by":"publisher","unstructured":"Leskovec J, Kleinberg JM, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery and data mining, Chicago, Illinois, USA, August 21\u201324, 2005, pp 177\u2013187. \n                    https:\/\/doi.org\/10.1145\/1081870.1081893","DOI":"10.1145\/1081870.1081893"},{"key":"439_CR15","doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen JM, Glance NS (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, San Jose, California, USA, August 12\u201315, 2007, pp 420\u2013429. \n                    https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"issue":"1","key":"439_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123. \n                    https:\/\/doi.org\/10.1080\/15427951.2009.10129177","journal-title":"Internet Math"},{"key":"439_CR17","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. \n                    https:\/\/doi.org\/10.1109\/TKDE.2019.2904969","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"10","key":"439_CR18","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1016\/j.comnet.2013.04.002","volume":"57","author":"NP Nguyen","year":"2013","unstructured":"Nguyen NP, Yan G, Thai MT (2013) Analysis of misinformation containment in online social networks. Comput Netw 57(10):2133\u20132146. \n                    https:\/\/doi.org\/10.1016\/j.comnet.2013.04.002","journal-title":"Comput Netw"},{"key":"439_CR19","unstructured":"Page L, Brin S, Motwani R, Winograd T (1998) The pagerank citation ranking: bringing order to the web. Technical Report, Stanford Digital Library Technologies Project"},{"key":"439_CR20","doi-asserted-by":"publisher","unstructured":"Pham CV, Dinh HM, Nguyen HD, Dang HT, Hoang HX (2017) Limiting the spread of epidemics within time constraint on online social networks. In: Proceedings of the eighth international symposium on information and communication technology, Nha Trang City, Viet Nam, December 7\u20138, 2017, pp 262\u2013269. \n                    https:\/\/doi.org\/10.1145\/3155133.3155157","DOI":"10.1145\/3155133.3155157"},{"issue":"4","key":"439_CR21","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1007\/s10878-018-0252-3","volume":"35","author":"CV Pham","year":"2018","unstructured":"Pham CV, Thai MT, Duong HV, Bui BQ, Hoang HX (2018) Maximizing misinformation restriction within time and budget constraints. J Comb Optim 35(4):1202\u20131240. \n                    https:\/\/doi.org\/10.1007\/s10878-018-0252-3","journal-title":"J Comb Optim"},{"key":"439_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-15939-8_7","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"B. Aditya Prakash","year":"2010","unstructured":"Prakash BA, Tong H, Valler N, Faloutsos M, Faloutsos C (2010) Virus propagation on time-varying networks: theory and immunization algorithms. In: Machine learning and knowledge discovery in databases, European conference, ECML PKDD 2010, Barcelona, Spain, September 20\u201324, 2010, Proceedings, Part III, pp 99\u2013114. \n                    https:\/\/doi.org\/10.1007\/978-3-642-15939-8_7"},{"key":"439_CR23","unstructured":"Ripeanu M, Foster IT, Iamnitchi A (2002) Mapping the gnutella network: properties of large-scale peer-to-peer systems and implications for system design. CoRR \n                    arXiv:cs.DC\/0209028"},{"key":"439_CR24","doi-asserted-by":"publisher","unstructured":"Song C, Hsu W, Lee M (2015) Node immunization over infectious period. In: Proceedings of the 24th ACM international conference on information and knowledge management, CIKM 2015, Melbourne, VIC, Australia, October 19\u201323, 2015, pp 831\u2013840. \n                    https:\/\/doi.org\/10.1145\/2806416.2806522","DOI":"10.1145\/2806416.2806522"},{"key":"439_CR25","doi-asserted-by":"publisher","unstructured":"Song C, Hsu W, Lee M (2017) Temporal influence blocking: minimizing the effect of misinformation in social networks. In: 33rd IEEE international conference on data engineering, ICDE 2017, San Diego, CA, USA, April 19\u201322, 2017, pp 847\u2013858. \n                    https:\/\/doi.org\/10.1109\/ICDE.2017.134","DOI":"10.1109\/ICDE.2017.134"},{"issue":"2","key":"439_CR26","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 (2018a) Distributed rumor blocking with multiple positive cascades. IEEE Trans Comput Soc Syst 5(2):468\u2013480. \n                    https:\/\/doi.org\/10.1109\/TCSS.2018.2818661","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"439_CR27","doi-asserted-by":"publisher","unstructured":"Tong GA, Wu W, Guo L, Li D, Liu C, Liu B, Du D (2017) An efficient randomized algorithm for rumor blocking in online social networks. In: 2017 IEEE conference on computer communications, INFOCOM 2017, Atlanta, GA, USA, May 1\u20134, 2017, pp 1\u20139. \n                    https:\/\/doi.org\/10.1109\/INFOCOM.2017.8056957","DOI":"10.1109\/INFOCOM.2017.8056957"},{"key":"439_CR28","unstructured":"Tong GA, Du D, Wu W (2018b) On misinformation containment in online social networks. In: Advances in neural information processing systems 31: annual conference on neural information processing systems 2018, NeurIPS 2018, 3\u20138 December 2018, Montr\u00e9al, Canada., pp 339\u2013349. \n                    http:\/\/papers.nips.cc\/paper\/7317-on-misinformation-containment-in-online-social-networks"},{"key":"439_CR29","doi-asserted-by":"publisher","unstructured":"Tong H, Prakash BA, Tsourakakis CE, Eliassi-Rad T, Faloutsos C, Chau DH (2010) On the vulnerability of large graphs. In: ICDM 2010, The 10th IEEE international conference on data mining, Sydney, Australia, 14\u201317 December 2010, pp 1091\u20131096. \n                    https:\/\/doi.org\/10.1109\/ICDM.2010.54","DOI":"10.1109\/ICDM.2010.54"},{"issue":"3","key":"439_CR30","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant LG (1979) The complexity of enumeration and reliability problems. SIAM J Comput 8(3):410\u2013421. \n                    https:\/\/doi.org\/10.1137\/0208032","journal-title":"SIAM J Comput"},{"issue":"2","key":"439_CR31","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/2803176","volume":"10","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Prakash BA (2015) Data-aware vaccine allocation over large networks. TKDD 10(2):20:1\u201320:32. \n                    https:\/\/doi.org\/10.1145\/2803176","journal-title":"TKDD"},{"issue":"3","key":"439_CR32","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2885494","volume":"34","author":"H Zhang","year":"2016","unstructured":"Zhang H, Alim MA, Li X, Thai MT, Nguyen HT (2016a) Misinformation in online social networks: detect them all with a limited budget. ACM Trans Inf Syst 34(3):18:1\u201318:24. \n                    https:\/\/doi.org\/10.1145\/2885494","journal-title":"ACM Trans Inf Syst"},{"issue":"12","key":"439_CR33","doi-asserted-by":"publisher","first-page":"3339","DOI":"10.1109\/TKDE.2016.2605088","volume":"28","author":"Y Zhang","year":"2016","unstructured":"Zhang Y, Adiga A, Saha S, Vullikanti A, Prakash BA (2016b) Near-optimal algorithms for controlling propagation at group scale on networks. IEEE Trans Knowl Data Eng 28(12):3339\u20133352. \n                    https:\/\/doi.org\/10.1109\/TKDE.2016.2605088","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"439_CR34","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TNET.2015.2394793","volume":"24","author":"H Zhang","year":"2016","unstructured":"Zhang H, Nguyen DT, Zhang H, Thai MT (2016c) Least cost influence maximization across multiple social networks. IEEE\/ACM Trans Netw (TON) 24(2):929\u2013939","journal-title":"IEEE\/ACM Trans Netw (TON)"},{"key":"439_CR35","doi-asserted-by":"publisher","unstructured":"Zheng J, Pan L (2018) Least cost rumor community blocking optimization in social networks. In: 2018 third international conference on security of smart cities, industrial control system and communications (SSIC), pp 1\u20135. \n                    https:\/\/doi.org\/10.1109\/SSIC.2018.8556739","DOI":"10.1109\/SSIC.2018.8556739"},{"key":"439_CR36","doi-asserted-by":"publisher","first-page":"27272","DOI":"10.1109\/ACCESS.2019.2900708","volume":"7","author":"W Zhu","year":"2019","unstructured":"Zhu W, Yang W, Xuan S, Man D, Wang W, Du X, Guizani M (2019) Location-based seeds selection for influence blocking maximization in social networks. IEEE Access 7:27272\u201327287. \n                    https:\/\/doi.org\/10.1109\/ACCESS.2019.2900708","journal-title":"IEEE Access"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00439-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00439-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00439-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T13:28:17Z","timestamp":1596115697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00439-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["439"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00439-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"25 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}