{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T20:38:13Z","timestamp":1764103093370,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:00:00Z","timestamp":1584576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:00:00Z","timestamp":1584576000000},"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":["World Wide Web"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s11280-019-00748-z","type":"journal-article","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T10:02:48Z","timestamp":1584612168000},"page":"2323-2340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Efficient targeted influence minimization in big social networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Xinjue","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7005-8150","authenticated-orcid":false,"given":"Ke","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jeffery Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"key":"748_CR1","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J.T., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of SODA, pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"748_CR2","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of ACM SIGKDD, pp. 1029\u20131038 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"748_CR3","doi-asserted-by":"crossref","unstructured":"Dinitz, Y.: Dinitz\u2019 algorithm: the original version and even\u2019s version. In: Theoretical Computer Science, Essays in Memory of Shimon Even, pp. 218\u2013240 (2006)","DOI":"10.1007\/11685654_10"},{"key":"748_CR4","unstructured":"on Drugs, U.N.O., Crime: The use of the internet for terrorist purposes (2012)"},{"key":"748_CR5","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F.: Distributed minimum cut approximation. In: Proceedings of DISC, pp. 1\u201315 (2013)","DOI":"10.1007\/978-3-642-41527-2_1"},{"key":"748_CR6","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of ACM SIGKDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"748_CR7","unstructured":"Khalil, E., Dilkina, B., Song, L.: Cuttingedge: Influence minimization in networks. In: Proceedings of Workshop on Frontiers of Network Analysis: Methods, Models, and Applications at NIPS (2013)"},{"key":"748_CR8","unstructured":"Kimura, M., Saito, K., Motoda, H.: Minimizing the spread of contamination by blocking links in a network. In: Proceedings of AAAI, pp. 1175\u20131180 (2008)"},{"key":"748_CR9","unstructured":"Kimura, M., Saito, K., Nakano, R.: Extracting influential nodes for information diffusion on a social network. In: Proceedings of AAAI, pp. 1371\u20131376 (2007)"},{"issue":"10","key":"748_CR10","first-page":"1070","volume":"8","author":"Y Li","year":"2015","unstructured":"Li, Y., Zhang, D., Tan, K.: Real-time targeted influence maximization for online advertisements. PVLDB 8(10), 1070\u20131081 (2015)","journal-title":"PVLDB"},{"key":"748_CR11","doi-asserted-by":"crossref","unstructured":"Luo, C., Cui, K., Zheng, X., Zeng, D.D.: Time critical disinformation influence minimization in online social networks. In: Proceedings of JISIC, pp. 68\u201374 (2014)","DOI":"10.1109\/JISIC.2014.20"},{"issue":"1","key":"748_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2014i. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"748_CR13","unstructured":"Papadimitriou, C.H., Steiglitz, K.: The Max-Flow, Min-Cut theorem. In: Combinatorial Optimization: Algorithms and Complexity, pp. 117\u2013120. Prentice-Hall (1982)"},{"issue":"01","key":"748_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1017\/nws.2014.3","volume":"2","author":"MG Rodriguez","year":"2014","unstructured":"Rodriguez, M.G., Leskovec, J., Balduzzi, D., Sch\u00f6lkopf, B.: Uncovering the structure and temporal dynamics of information propagation. Netw. Sci. 2(01), 26\u201365 (2014)","journal-title":"Netw. Sci."},{"key":"748_CR15","doi-asserted-by":"crossref","unstructured":"Shirazipourazad, S., Bogard, B., Vachhani, H., Sen, A., Horn, P.: Influence propagation in adversarial setting: how to defeat competition with least amount of investment. In: Proceedings of ACM SIGMOD, pp. 585\u2013594 (2012)","DOI":"10.1145\/2396761.2396837"},{"key":"748_CR16","doi-asserted-by":"crossref","unstructured":"Song, C., Hsu, W., Lee, M.: Temporal influence blocking: Minimizing the effect of misinformation in social networks. In: Proceedings of IEEE ICDE, pp. 847\u2013858 (2017)","DOI":"10.1109\/ICDE.2017.134"},{"key":"748_CR17","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of ACM SIGMOD, pp. 75\u201386 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"748_CR18","unstructured":"Vazirani, V.V.: Approximation algorithms. Springer Science & Business Media (2013)"},{"key":"748_CR19","unstructured":"Wang, S., Zhao, X., Chen, Y., Li, Z., Zhang, K., Xia, J.: Negative influence minimizing by blocking nodes in social networks. In: Proceedings of Late-Breaking Developments in the Field of Artificial Intelligence, pp. 134\u2013136 (2013)"},{"key":"748_CR20","doi-asserted-by":"crossref","unstructured":"Wang, X., Deng, K., Li, J., Yu, J.X., Jensen, C.S.: Targeted influence minimization in social networks. In: Proceedings of PAKDD (2018)","DOI":"10.1007\/978-3-319-93040-4_54"},{"key":"748_CR21","doi-asserted-by":"crossref","unstructured":"Yao, Q., Shi, R., Zhou, C., Wang, P., Guo, L.: Topic-aware social influence minimization. In: Proceedings of WWW \u201915 Companion, 1, pp. 139\u2013140 (2015)","DOI":"10.1145\/2740908.2742767"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-019-00748-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-019-00748-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-019-00748-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T05:25:16Z","timestamp":1666157116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-019-00748-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,19]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["748"],"URL":"https:\/\/doi.org\/10.1007\/s11280-019-00748-z","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2020,3,19]]},"assertion":[{"value":"16 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}