{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:29:04Z","timestamp":1743082144505,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030484385"},{"type":"electronic","value":"9783030484392"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-48439-2_16","type":"book-chapter","created":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T15:04:52Z","timestamp":1600959892000},"page":"133-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Bicriterion Maximum Flow Network Interdiction Problem in s-t-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Luca E.","family":"Sch\u00e4fer","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Dietz","sequence":"additional","affiliation":[]},{"given":"Marco V.","family":"Natale","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Ruzika","sequence":"additional","affiliation":[]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[]},{"given":"Carlos M.","family":"Fonseca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,25]]},"reference":[{"key":"16_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River (1993)"},{"issue":"6","key":"16_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. (1987). A network interdiction model for hospital infection control. Comput. Biol. Med. 17(6), 413\u2013422","journal-title":"Comput. Biol. Med."},{"issue":"9","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9), 1124\u20131137 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Burch, C., Carr, R., Krumke, S., Marathe, M., Phillips, C., Sundberg, E.: A decomposition-based pseudoapproximation algorithm for network flow inhibition. In: Network Interdiction and Stochastic Integer Programming, pp. 51\u201368. Springer, Berlin (2003)","DOI":"10.1007\/0-306-48109-X_3"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF02591893","volume":"26","author":"PJ Carstensen","year":"1983","unstructured":"Carstensen, P.J.: Complexity of some parametric integer and network programming problems. Math. Program. 26(1), 64\u201375 (1983)","journal-title":"Math. Program."},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1002\/net.21739","volume":"69","author":"SR Chestnut","year":"2017","unstructured":"Chestnut, S.R., Zenklusen, R.: Hardness and approximation for network flow interdiction. Networks 69(4), 378\u2013387 (2017)","journal-title":"Networks"},{"key":"16_CR7","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90041-D","volume":"98","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D.: Parallel recognition of series-parallel graphs. Inf. Comput. 98(1), 41\u201355 (1992)","journal-title":"Inf. Comput."},{"issue":"3","key":"16_CR9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8(3), 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"16_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. wh freeman, New York (2002)"},{"key":"16_CR11","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 86\u201392. IEEE, New York (2000)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Phillips, C.A.: The network inhibition problem. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 776\u2013785. ACM, New York (1993)","DOI":"10.1145\/167088.167286"},{"key":"16_CR13","unstructured":"Safer, H.M., et al.: Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. Technical report, Massachusetts Institute of Technology (MIT), New York. Sloan School of Management"},{"issue":"2","key":"16_CR14","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"RK Wood","year":"1993","unstructured":"Wood, R.K.: Deterministic network interdiction. Math. Comput. Model. 17(2), 1\u201318 (1993)","journal-title":"Math. Comput. Model."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48439-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T15:08:27Z","timestamp":1600960107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48439-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030484385","9783030484392"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48439-2_16","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}