{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:45:25Z","timestamp":1761561925546,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","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":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_45","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"603-612","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Fast Greedy Algorithm for the Critical Node Detection Problem"],"prefix":"10.1007","author":[{"given":"Mario","family":"Ventresca","sequence":"first","affiliation":[]},{"given":"Dionne","family":"Aleman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discrete Appl. Math. 161(16\u201317), 2349\u20132360 (2013)","DOI":"10.1016\/j.dam.2013.03.021"},{"issue":"7","key":"45_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. 36(7), 2193\u20132200 (2009)","journal-title":"Comput. Oper. Res."},{"key":"45_CR3","unstructured":"Aspnes, J., Chang, K., Yampolskiy, A.: Inoculation strategies for victims of viruses and the sum-of-squares partition problem. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201905, pp. 43\u201352. Society for Industrial and Applied Mathematics (2005)"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Boginski, V., Commander, C.: Identifying critical nodes in protein-protein interaction networks. In: Clustering Challenges in Biological, Networks, pp. 153\u2013166 (2009)","DOI":"10.1142\/9789812771667_0007"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Chen, P., David, M., Kempe, D.: Better vaccination strategies for better people. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 179\u2013188. ACM (2010)","DOI":"10.1145\/1807342.1807370"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10589-012-9458-y","volume":"53","author":"M Di Summa","year":"2012","unstructured":"Di Summa, M., Grosso, A., Locatelli, M.: Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. 53, 649\u2013680 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"12","key":"45_CR8","doi-asserted-by":"publisher","first-page":"1766","DOI":"10.1016\/j.cor.2011.02.016","volume":"38","author":"M Di Summa","year":"2011","unstructured":"Di Summa, M., Grosso, A., Locatelli, M.: Complexity of the critical node problem over trees. Comput. Oper. Res. 38(12), 1766\u20131774 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"45_CR9","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TNET.2011.2170849","volume":"20","author":"TN Dinh","year":"2012","unstructured":"Dinh, T.N., Xuan, Y., Thai, M.T., Pardalos, P.M., Znati, T.: On new approaches of assessing network vulnerability: Hardness and approximation. IEEE\/ACM Trans. Networking 20(2), 609\u2013619 (2012)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"1","key":"45_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10878-014-9742-0","volume":"28","author":"TN Dinh","year":"2014","unstructured":"Dinh, T.N., Thai, M.T., Nguyen, H.T.: Bound and exact methods for assessing link vulnerability in complex networks. J. Comb. Optim. 28(1), 3\u201324 (2014)","journal-title":"J. Comb. Optim."},{"issue":"8","key":"45_CR11","doi-asserted-by":"publisher","first-page":"e12200","DOI":"10.1371\/journal.pone.0012200","volume":"5","author":"KE Joyce","year":"2010","unstructured":"Joyce, K.E., Laurienti, P.J., Burdette, J.H., Hayasaka, S.: A new measure of centrality for brain networks. PLoS ONE 5(8), e12200 (2010)","journal-title":"PLoS ONE"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence in a social network. In: Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"5","key":"45_CR13","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"45_CR14","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 2010 IEEE 30th International Conference on Distributed Computing Systems, pp. 348\u2013357 (2010)","DOI":"10.1109\/ICDCS.2010.70"},{"issue":"1","key":"45_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Dis. Data 1(1), 2\u201341 (2007)","journal-title":"ACM Trans. Knowl. Dis. Data"},{"key":"45_CR16","unstructured":"McAuley, J.J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS, pp. 548\u2013556 (2012)"},{"issue":"1","key":"45_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TSG.2012.2229398","volume":"4","author":"DT Nguyen","year":"2013","unstructured":"Nguyen, D.T., Shen, Y., Thai, M.T.: Detecting critical nodes in interdependent power networks for vulnerability assessment. IEEE Trans. Smart Grid 4(1), 151\u2013159 (2013)","journal-title":"IEEE Trans. Smart Grid"},{"key":"45_CR18","unstructured":"Opsahl, T.: Why anchorage is not (that) important: Binary ties and sample selection (2011). http:\/\/wp.me\/poFcY-Vw"},{"issue":"2","key":"45_CR19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T Opsahl","year":"2009","unstructured":"Opsahl, T., Panzarasa, P.: Clustering in weighted networks. Soc. Netw. 31(2), 155\u2013163 (2009)","journal-title":"Soc. Netw."},{"key":"45_CR20","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8476.001.0001","volume-title":"Networks of the Brain","author":"O Sporns","year":"2010","unstructured":"Sporns, O.: Networks of the Brain. The MIT Press, Cambridge (2010)"},{"issue":"2","key":"45_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"45_CR22","doi-asserted-by":"publisher","first-page":"2763","DOI":"10.1016\/j.cor.2012.02.008","volume":"39","author":"M Ventresca","year":"2012","unstructured":"Ventresca, M.: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Comput. Oper. Res. 39(11), 2763\u20132775 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"45_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.socnet.2013.01.002","volume":"35","author":"M Ventresca","year":"2013","unstructured":"Ventresca, M., Aleman, D.: Evaluation of strategies to mitigate contagion spread using social network characteristics. Soc. Netw. 35(1), 75\u201388 (2013)","journal-title":"Soc. Netw."},{"key":"45_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.cor.2013.09.012","volume":"43","author":"M Ventresca","year":"2014","unstructured":"Ventresca, M., Aleman, D.: A derandomized approximation algorithm for the critical node detection problem. Comput. Oper. Res. 43, 261\u2013270 (2014)","journal-title":"Comput. Oper. Res."},{"key":"45_CR25","doi-asserted-by":"crossref","unstructured":"Ventresca, M., Aleman, D.: Network robustness versus multi-strategy sequential attack. J. Complex Netw. (2014)","DOI":"10.1093\/comnet\/cnu010"},{"key":"45_CR26","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2014.02.003","volume":"48","author":"M Ventresca","year":"2014","unstructured":"Ventresca, M., Aleman, D.: A randomized algorithm with local search for containment of pandemic disease spread. Comput. Oper. Res. 48, 11\u201319 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"45_CR27","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/s11590-013-0666-x","volume":"8","author":"A Veremyev","year":"2014","unstructured":"Veremyev, A., Boginski, V., Pasiliao, E.L.: Exact identification of critical nodes in sparse networks via new compact formulations. Optim. Lett. 8(4), 1245\u20131259 (2014)","journal-title":"Optim. Lett."},{"issue":"1","key":"45_CR28","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10878-014-9730-4","volume":"28","author":"A Veremyev","year":"2014","unstructured":"Veremyev, A., Prokopyev, O.A., Pasiliao, E.L.: An integer programming framework for critical elements detection in graphs. J. Comb. Optim. 28(1), 233\u2013273 (2014)","journal-title":"J. Comb. Optim."},{"key":"45_CR29","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 400\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T12:17:38Z","timestamp":1675253858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}