{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:15Z","timestamp":1725745275688},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_23","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T13:17:34Z","timestamp":1376659054000},"page":"317-331","source":"Crossref","is-referenced-by-count":3,"title":["Interdiction Problems on Planar Graphs"],"prefix":"10.1007","author":[{"given":"Feng","family":"Pan","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Schild","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.orl.2009.09.013","volume":"38","author":"D.S. Altner","year":"2010","unstructured":"Altner, D.S., Ergun, \u00d6., Uhan, N.A.: The maximum flow network interdiction problem: Valid inequalities, integrality gaps, and approximability. Oper. Res. Lett.\u00a038(1), 33\u201338 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0010-4825(87)90060-6","volume":"17","author":"N. Assimakopoulos","year":"1987","unstructured":"Assimakopoulos, N.: A network interdiction model for hospital infection control. Comput. Biol. Med.\u00a017(6), 413\u2013422 (1987)","journal-title":"Comput. Biol. Med."},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"23_CR4","first-page":"116","volume":"36","author":"H.L. Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Some classes of graphs with bounded treewidth. Bulletin of the EATCS\u00a036, 116\u2013125 (1988)","journal-title":"Bulletin of the EATCS"},{"key":"23_CR5","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/0-306-48109-X_3","volume-title":"Network Interdiction and Stochastic Integer Programming","author":"C. Burch","year":"2003","unstructured":"Burch, C., Carr, R., Krumke, S., Marathe, M., Phillips, C., Sundberg, E.: A decomposition-based pseudoapproximation algorithm for network flow inhibition. In: Woodruff, D.L. (ed.) Network Interdiction and Stochastic Integer Programming. Operations Research\/Computer Science Interfaces Series, vol.\u00a022, pp. 51\u201368. Springer, US (2003)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-36694-9_14","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Dinitz","year":"2013","unstructured":"Dinitz, M., Gupta, A.: Packing interdiction and partial covering problems. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol.\u00a07801, pp. 157\u2013168. Springer, Heidelberg (2013)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem in np complete. SIAM Journal of Applied Mathematics\u00a032, 826\u2013834 (1977)","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar hamiltonian circuit problem is np-complete. SIAM J. Comput.\u00a05(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Montgomery, D.C., Ghare, P.M., Turner, W.C.: Optimal interdiction policy for a flow network. Naval Research Logistics Quarterly\u00a018, 37\u201345","DOI":"10.1002\/nav.3800180103"},{"issue":"1-2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01917434","volume":"8","author":"R. Halin","year":"1976","unstructured":"Halin, R.: S-functions for graphs. Journal of Geometry\u00a08(1-2), 171\u2013186 (1976)","journal-title":"Journal of Geometry"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/nav.3800100132","volume":"10","author":"A.J. Hoffman","year":"1963","unstructured":"Hoffman, A.J., Markowitz, H.M.: A note on shortest path, assignment, and transportation problems. Naval Research Logistics Quarterly\u00a010(1), 375\u2013379 (1963)","journal-title":"Naval Research Logistics Quarterly"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Karp, R.M.: A n\n                  5\/2 algorithm for maximum matchings in bipartite graphs. In: SWAT (FOCS), pp. 122\u2013125 (1971)","DOI":"10.1109\/SWAT.1971.1"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Israeli, E., Kevin Wood, R.: Shortest-path network interdiction. Networks\u00a040, 2002 (2002)","DOI":"10.1002\/net.10039"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/TPWRS.2008.2004825","volume":"24","author":"R. Kevin Wood","year":"2009","unstructured":"Kevin Wood, R., Salmeron, J., Baldick, R.: Worst-case interdiction analysis of large-scale electric power grids. IEEE Transactions on Power Systems\u00a024, 96\u2013104 (2009)","journal-title":"IEEE Transactions on Power Systems"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s00224-007-9025-6","volume":"43","author":"L. Khachiyan","year":"2008","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K.M., Gurvich, V., Rudolf, G., Zhao, J.: On short paths interdiction problems: Total and node-wise limited interdiction. Theory Comput. Syst.\u00a043(2), 204\u2013233 (2008)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K. Malik","year":"1989","unstructured":"Malik, K., Mittal, A.K., Gupta, S.K.: The k most vital arcs in the shortest path problem. Oper. Res. Lett.\u00a08(4), 223\u2013227 (1989)","journal-title":"Oper. Res. Lett."},{"key":"23_CR17","unstructured":"Pan, F., Schild, A.: Interdiction problems on planar graphs (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1305.1407"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Phillips, C.A.: The network inhibition problem. In: STOC, pp. 776\u2013785 (1993)","DOI":"10.1145\/167088.167286"},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. iii. Planar tree-width. Journal of Combinatorial Theory, Series B\u00a036(1), 49\u201364 (1984)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"6","key":"23_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0020-0190(98)00070-2","volume":"66","author":"S. Schwarz","year":"1998","unstructured":"Schwarz, S., Krumke, S.: On budget-constrained flow improvement. Information Processing Letters\u00a066(6), 291\u2013297 (1998)","journal-title":"Information Processing Letters"},{"issue":"3","key":"23_CR21","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1008293.1008294","volume":"5","author":"L. Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.: Planar 3-colorability is polynomial complete. SIGACT News\u00a05(3), 19\u201325 (1973)","journal-title":"SIGACT News"},{"issue":"2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R. Kevin Wood","year":"1993","unstructured":"Kevin Wood, R.: Deterministic network interdiction. Mathematical and Computer Modelling\u00a017(2), 1\u201318 (1993)","journal-title":"Mathematical and Computer Modelling"},{"issue":"15","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1016\/j.dam.2010.06.006","volume":"158","author":"R. Zenklusen","year":"2010","unstructured":"Zenklusen, R.: Matching interdiction. Discrete Applied Mathematics\u00a0158(15), 1676\u20131690 (2010)","journal-title":"Discrete Applied Mathematics"},{"issue":"13","key":"23_CR24","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1016\/j.dam.2010.04.008","volume":"158","author":"R. Zenklusen","year":"2010","unstructured":"Zenklusen, R.: Network flow interdiction on planar graphs. Discrete Applied Mathematics\u00a0158(13), 1441\u20131455 (2010)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40328-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:40:26Z","timestamp":1558028426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}