{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:17:51Z","timestamp":1742912271688,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319930398"},{"type":"electronic","value":"9783319930404"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93040-4_54","type":"book-chapter","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T13:29:41Z","timestamp":1529155781000},"page":"689-700","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Targeted Influence Minimization in Social Networks"],"prefix":"10.1007","author":[{"given":"Xinjue","family":"Wang","sequence":"first","affiliation":[]},{"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":[[2018,6,17]]},"reference":[{"key":"54_CR1","first-page":"946","volume-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Christian Borgs","year":"2013","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)"},{"key":"54_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":"54_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11685654_10","volume-title":"Theoretical Computer Science, Essays in Memory of Shimon Even","author":"Y Dinitz","year":"2006","unstructured":"Dinitz, Y.: Dinitz\u2019 algorithm: the original version and Even\u2019s version. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science, Essays in Memory of Shimon Even. LNCS, vol. 3895, pp. 218\u2013240. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11685654_10"},{"key":"54_CR4","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":"54_CR5","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":"54_CR6","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":"54_CR7","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":"54_CR8","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":"54_CR9","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"},{"key":"54_CR10","unstructured":"Papadimitriou, C.H., Steiglitz, K.: The max-flow, min-cut theorem. In: Combinatorial Optimization: Algorithms and Complexity, pp. 117\u2013120. Prentice-Hall (1982)"},{"key":"54_CR11","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":"54_CR12","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":"54_CR13","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":"54_CR14","doi-asserted-by":"crossref","unstructured":"Yao, Q., Shi, R., Zhou, C., Wang, P., Guo, L.: Topic-aware social influence minimization. In: Proceedings of WWW 2015 Companion, no. 1, pp. 139\u2013140 (2015)","DOI":"10.1145\/2740908.2742767"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93040-4_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:09:13Z","timestamp":1710324553000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93040-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319930398","9783319930404"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93040-4_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/prada-research.net\/pakdd18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}