{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:16:01Z","timestamp":1768454161766,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642255090","type":"print"},{"value":"9783642255106","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25510-6_18","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:51:09Z","timestamp":1322643069000},"page":"206-217","source":"Crossref","is-referenced-by-count":18,"title":["Controlling Infection by Blocking Nodes and Links Simultaneously"],"prefix":"10.1007","author":[{"given":"Jing","family":"He","sequence":"first","affiliation":[]},{"given":"Hongyu","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander flows, geomeric embeddings and graph partitioning. In: Proceedings of the 35th ACM STOC (2004)","DOI":"10.1145\/1007352.1007355"},{"issue":"7","key":"18_CR2","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A. Arulselvan","year":"2009","unstructured":"Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. Comput. Oper. Res.\u00a036(7), 2193\u20132200 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"18_CR3","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1016\/j.jcss.2006.02.003","volume":"72","author":"J. Aspnes","year":"2005","unstructured":"Aspnes, J., Chang, K.L., Yampolskiy, A.: Inoculation strategies for victims of viruses and the sum-of-squares partition problem. J. Comput. Syst. Sci.\u00a072(6), 1077\u20131093 (2005); Preliminary version in SODA 2005","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10588-006-7084-x","volume":"12","author":"S. Borgatti","year":"2006","unstructured":"Borgatti, S.: Identifying sets of key players in a social network. Comput. Math. Org. Theory\u00a012, 21\u201334 (2006)","journal-title":"Comput. Math. Org. Theory"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Chen, P.-A., David, M., Kempe, D.: Better vaccination strategies for better people. In: Proceedings of the 11th ACM EC (2010)","DOI":"10.1145\/1807342.1807370"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2009)","DOI":"10.1145\/1557019.1557047"},{"issue":"12","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1766","DOI":"10.1016\/j.cor.2011.02.016","volume":"38","author":"M. Summa Di","year":"2011","unstructured":"Di Summa, M., Grosso, A., Locatelli, M.: Complexity of the critical node problem over trees. Comput. Oper. Res.\u00a038(12), 1766\u20131774 (2011)","journal-title":"Comput. Oper. Res."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2001)","DOI":"10.1145\/502512.502525"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N. Garg","year":"1993","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput.\u00a025(2), 235\u2013251 (1993); Preliminary version in STOC 1993","journal-title":"SIAM J. Comput."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.S.: Learning influence probabilities in social networks. In: Proceedings of the 3rd ACM WSDM (2010)","DOI":"10.1145\/1718487.1718518"},{"issue":"5","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E. Halperin","year":"2002","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraph. SIAM J. Comput.\u00a031(5), 1608\u20131623 (2002)","journal-title":"SIAM J. Comput."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)","DOI":"10.1145\/956755.956769"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th ACM STOC (2002)","DOI":"10.1145\/510014.510017"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2003","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2\u2009\u2212\u2009\u03b5. J. Comput. Syst. Sci.\u00a074(3), 335\u2013349 (2003); Preliminary version in CCC 2003","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/11871637_27","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"M. Kimura","year":"2006","unstructured":"Kimura, M., Saito, K.: Tractable Models for Information Diffusion in Social Networks. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 259\u2013271. Springer, Heidelberg (2006)"},{"key":"18_CR16","unstructured":"Kimura, M., Saito, K., Motoda, H.: Minimizing the spread of contamination by blocking links in a network. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (2008)"},{"key":"18_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1007\/978-3-540-89197-0_94","volume-title":"PRICAI 2008: Trends in Artificial Intelligence","author":"M. Kimura","year":"2008","unstructured":"Kimura, M., Saito, K., Motoda, H.: Solving the Contamination Minimization Problem on Networks for the Linear Threshold Model. In: Ho, T.-B., Zhou, Z.-H. (eds.) PRICAI 2008. LNCS (LNAI), vol.\u00a05351, pp. 977\u2013984. Springer, Heidelberg (2008)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data.\u00a03(2) (2009)","DOI":"10.1145\/1514888.1514892"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Anil Kumar, V.S., Rajaraman, R., Sun, Z., Sundaram, R.: Existence theorems and approximation algorithms for generalized network security games. In: Proceedings of the 30th ICDCS (2010)","DOI":"10.1109\/ICDCS.2010.70"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.S.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-20877-5_30","volume-title":"Theory and Applications of Models of Computation","author":"A. Li","year":"2011","unstructured":"Li, A., Tang, L.: The Complexity and Approximability of Minimum Contamination Problems. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol.\u00a06648, pp. 298\u2013307. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25510-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:05:51Z","timestamp":1560989151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25510-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255090","9783642255106"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25510-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}