{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:39:47Z","timestamp":1743122387617,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_36","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"495-509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Most Vital Segment Barriers"],"prefix":"10.1007","author":[{"given":"Irina","family":"Kostitsyna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Polishchuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Staals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"36_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Alderson, D.L., Brown, G.G., Carlyle, W.M., Cox Jr., L.A.: Sometimes there is no most-vital arc: assessing and improving the operational resilience of systems. Technical report, Naval Postgraduate School Monterey CA (2013)","DOI":"10.5711\/1082598318121"},{"issue":"2","key":"36_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0167-6377(89)90003-5","volume":"8","author":"MO Ball","year":"1989","unstructured":"Ball, M.O., Golden, B.L., Vohra, R.V.: Finding the most vital arcs in a network. Oper. Res. Lett. 8(2), 73\u201376 (1989)","journal-title":"Oper. Res. Lett."},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-18173-8_3","volume-title":"Algorithms and Complexity","author":"C Bazgan","year":"2015","unstructured":"Bazgan, C., Nichterlein, A., Niedermeier, R.: A refined complexity analysis of finding the most vital edges for undirected shortest paths. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 47\u201360. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_3"},{"issue":"5","key":"36_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6(5), 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"36_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/PL00009429","volume":"21","author":"F Chin","year":"1999","unstructured":"Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discrete Comput. Geom. 21(3), 405\u2013420 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"36_CR7","unstructured":"Citovsky, G., Mayer, T., Mitchell, J.S.B.: TSP with locational uncertainty: the adversarial model. In: 33rd International Symposium on Computational Geometry. Leibniz International Proceedings in Informatics (LIPIcs), vol. 77, pp. 32:1\u201332:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"36_CR8","unstructured":"Collado, R.A., Papp, D.: Network interdiction-models, applications, unexplored directions. Rutcor Research Report, RRR4, Rutgers University, New Brunswick, NJ (2012)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Eriksson-Bique, S., Polishchuk, V., Sysikaski, M.: Optimal geometric flows via dual programs. In: Proceedings of the Thirtieth Annual Symposium on Computational Geometry, p. 100. ACM (2014)","DOI":"10.1145\/2582112.2582163"},{"issue":"3","key":"36_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/ijoc.2.3.253","volume":"2","author":"L Gewali","year":"1990","unstructured":"Gewali, L., Meng, A., Mitchell, J.S.B., Ntafos, S.: Path planning in $$0\/1\/\\infty $$ weighted regions with applications. ORSA J. Comput. 2(3), 253\u2013272 (1990)","journal-title":"ORSA J. Comput."},{"issue":"4","key":"36_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1002\/nav.3800250412","volume":"25","author":"B Golden","year":"1978","unstructured":"Golden, B.: A problem in network interdiction. Naval Research Logistics (NRL) 25(4), 711\u2013713 (1978)","journal-title":"Naval Research Logistics (NRL)"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"LJ Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Guo, Q., An, B., Tran-Thanh, L.: Playing repeated network interdiction games with semi-bandit feedback. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 3682\u20133690. AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/515"},{"issue":"14","key":"36_CR14","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1016\/S0010-4485(98)00063-3","volume":"30","author":"DS Kim","year":"1998","unstructured":"Kim, D.S.: Polygon offsetting using a voronoi diagram and two stacks. Comput. Aided Des. 30(14), 1069\u20131076 (1998)","journal-title":"Comput. Aided Des."},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Kostitsyna, I., L\u00f6ffler, M., Staals, F., Polishchuk, V.: Most vital segment barriers. CoRR abs\/1905.01185 (2019)","DOI":"10.1007\/978-3-030-24766-9_36"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-1-4612-2666-6_17","volume-title":"Multiple Criteria Decision Making","author":"KC Lin","year":"1994","unstructured":"Lin, K.C., Chern, M.S.: Finding the most vital arc in the shortest path problem with fuzzy arc lengths. In: Tzeng, G.H., Wang, H.F., Wen, U.P., Yu, P.L. (eds.) Multiple Criteria Decision Making, pp. 159\u2013168. Springer, New York (1994). https:\/\/doi.org\/10.1007\/978-1-4612-2666-6_17"},{"issue":"1","key":"36_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195911003524","volume":"21","author":"M L\u00f6ffler","year":"2011","unstructured":"L\u00f6ffler, M.: Existence and computation of tours through imprecise points. Int. J. Comput. Geom. Appl. 21(1), 1\u201324 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"36_CR18","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/nav.3800180408","volume":"18","author":"SH Lubore","year":"1971","unstructured":"Lubore, S.H., Ratliff, H., Sicilia, G.: Determining the most vital link in a flow network. Naval Research Logistics (NRL) 18(4), 497\u2013502 (1971)","journal-title":"Naval Research Logistics (NRL)"},{"issue":"4","key":"36_CR19","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0221038","volume":"21","author":"EA Melissaratos","year":"1992","unstructured":"Melissaratos, E.A., Souvaine, D.L.: Shortest paths help solve geometric optimization problems in planar regions. SIAM J. Comput. 21(4), 601\u2013638 (1992)","journal-title":"SIAM J. Comput."},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"JSB Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier, Amsterdam (2000)"},{"issue":"1","key":"36_CR21","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0022-0000(90)90020-L","volume":"40","author":"JS Mitchell","year":"1990","unstructured":"Mitchell, J.S.: On maximum flows in polyhedral domains. J. Comput. Syst. Sci. 40(1), 88\u2013123 (1990)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"36_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(00)00175-7","volume":"79","author":"E Nardelli","year":"2001","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: A faster computation of the most vital edge of a shortest path. Inf. Process. Lett. 79(2), 81\u201385 (2001)","journal-title":"Inf. Process. Lett."},{"key":"36_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comnet.2014.10.026","volume":"77","author":"S Neumayer","year":"2015","unstructured":"Neumayer, S., Efrat, A., Modiano, E.: Geographic max-flow and min-cut under a circular disk failure model. Comput. Netw. 77, 117\u2013127 (2015)","journal-title":"Comput. Netw."},{"key":"36_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/BFb0035787","volume-title":"Automata, Languages and Programming","author":"CH Papadimitriou","year":"1989","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 610\u2013620. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035787"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Polishchuk, V., Mitchell, J.S.: Thick non-crossing paths and minimum-cost flows in polygonal domains. In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry, SCG 2007, pp. 56\u201365. ACM (2007)","DOI":"10.1145\/1247069.1247079"},{"issue":"6","key":"36_CR26","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/BF02187751","volume":"4","author":"R Pollack","year":"1989","unstructured":"Pollack, R., Sharir, M., Rote, G.: Computing the geodesic center of a simple polygon. Discrete Comput. Geom. 4(6), 611\u2013626 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"36_CR27","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/mnsc.21.5.531","volume":"21","author":"HD Ratliff","year":"1975","unstructured":"Ratliff, H.D., Sicilia, G.T., Lubore, S.: Finding the n most vital links in flow networks. Manage. Sci. 21(5), 531\u2013539 (1975)","journal-title":"Manage. Sci."},{"key":"36_CR28","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1007\/978-1-4419-7997-1_61","volume-title":"Handbook of Combinatorial Optimization","author":"JC Smith","year":"2013","unstructured":"Smith, J.C., Prince, M., Geunes, J.: Modern network interdiction problems and algorithms. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 1949\u20131987. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_61"},{"key":"36_CR29","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02592050","volume":"26","author":"G Strang","year":"1983","unstructured":"Strang, G.: Maximal flow through a domain. Math. Program. 26, 123\u2013143 (1983)","journal-title":"Math. Program."},{"issue":"3","key":"36_CR30","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10898-016-0422-8","volume":"67","author":"P Zhang","year":"2017","unstructured":"Zhang, P., Fan, N.: Analysis of budget for interdiction on multicommodity network flows. J. Global Optim. 67(3), 495\u2013525 (2017)","journal-title":"J. Global Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:55:32Z","timestamp":1710266132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}