{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:57Z","timestamp":1725796617462},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_15","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"166-178","source":"Crossref","is-referenced-by-count":5,"title":["Parameterized Complexity of Edge Interdiction Problems"],"prefix":"10.1007","author":[{"given":"Jiong","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yash Raj","family":"Shrestha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.jcss.2010.12.002","volume":"77","author":"O. Amini","year":"2011","unstructured":"Amini, O., Fomin, F.V., Saurabh, S.: Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci.\u00a077(6), 1159\u20131171 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0693-1","volume":"107","author":"S. Arora","year":"2006","unstructured":"Arora, S., Karakostas, G.: A 2 + \u03b5 approximation algorithm for the k-mst problem. Math. Program.\u00a0107(3), 491\u2013504 (2006)","journal-title":"Math. Program."},{"issue":"6","key":"15_CR3","first-page":"413","volume":"17","author":"N. Assimakopoulos","year":"1987","unstructured":"Assimakopoulos, N.: A network interdiction model for hospital infection control. Bio. Med.\u00a017(6), 413\u2013422 (1987)","journal-title":"Bio. Med."},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R. Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. J. Algorithms\u00a039(2), 137\u2013144 (2001)","journal-title":"J. Algorithms"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/0-306-48109-X_3","volume":"22","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. Network Interdiction and Stochastic Integer Programming\u00a022, 51\u201368 (2003)","journal-title":"Network Interdiction and Stochastic Integer Programming"},{"key":"15_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":"15_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S1571-0661(04)81014-4","volume":"78","author":"R.G. Downey","year":"2003","unstructured":"Downey, R.G., Estivill-Castro, V., Fellows, M.R., Prieto, E., Rosamond, F.A.: Cutting up is hard to do: The parameterized complexity of k-cut and related problems. Electr. Notes Theor. Comput. Sci.\u00a078, 209\u2013222 (2003)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"16","key":"15_CR8","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ipl.2011.05.016","volume":"111","author":"F.V. Fomin","year":"2011","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Subexponential algorithms for partial cover problems. Inf. Process. Lett.\u00a0111(16), 814\u2013818 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"14","key":"15_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(73)90059-2","volume":"14","author":"R. Forcade","year":"1973","unstructured":"Forcade, R.: Smallest maximal matching in the graph of the d-dimensional cube. J. Combinatorial Theory Ser. B\u00a014(14), 153\u2013156 (1973)","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1006\/jagm.1999.1026","volume":"33","author":"G.N. Frederickson","year":"1999","unstructured":"Frederickson, G.N., Solis-Oba, R.: Increasing the weight of minimum spanning trees. J. Algorithms\u00a033(2), 244\u2013266 (1999)","journal-title":"J. Algorithms"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11534273_5","volume-title":"Algorithms and Data Structures","author":"J. Guo","year":"2005","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 36\u201348. Springer, Heidelberg (2005)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-54945-5_49","volume-title":"ISA \u201991 Algorithms","author":"W.-L. Hsu","year":"1991","unstructured":"Hsu, W.-L., Ma, T.-H.: Substitution decomposition on chordal graphs and applications. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol.\u00a0557, pp. 52\u201360. Springer, Heidelberg (1991)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Thorup, M.: The minimum k-way cut of bounded size is fixed-parameter tractable. In: FOCS, pp. 160\u2013169 (2011)","DOI":"10.1109\/FOCS.2011.53"},{"issue":"2-3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0166-218X(01)00189-5","volume":"113","author":"W. Liang","year":"2001","unstructured":"Liang, W.: Finding the k most vital edges with respect to minimum spanning trees for fixed k. Discrete Applied Mathematics\u00a0113(2-3), 319\u2013327 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"13","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1016\/S0167-8191(97)00098-7","volume":"23","author":"W. Liang","year":"1997","unstructured":"Liang, W., Shen, X.: Finding the k most vital edges in the minimum spanning tree problem. Parallel Computing\u00a023(13), 1889\u20131907 (1997)","journal-title":"Parallel Computing"},{"key":"15_CR16","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, USA (2006)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Pan, F., Schild, A.: Interdiction problems on planar graphs. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX\/RANDOM 2013. LNCS, vol.\u00a08096, pp. 317\u2013331. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-40328-6_23"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/167088.167286","volume-title":"Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC 1993","author":"C.A. Phillips","year":"1993","unstructured":"Phillips, C.A.: The network inhibition problem. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 776\u2013785. ACM, New York (1993)"},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/TPWRS.2008.2004825","volume":"24","author":"J. Salmeron","year":"2009","unstructured":"Salmeron, J., Wood, K., Baldick, R.: Worst-case interdiction analysis of large-scale electric power grids. IEEE Transactions on Power Systems\u00a024(1), 96\u2013104 (2009)","journal-title":"IEEE Transactions on Power Systems"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Washburn, A., Wood, R.K.: Two-person zero-sum games for network interdiction 43(2), 243\u2013251 (1995)","DOI":"10.1287\/opre.43.2.243"},{"key":"15_CR21","unstructured":"Wood, R.K.: Optimal interdiction policy for a flow network 18, 37\u201345 (1971)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Wood, R.K.: Deterministic network interdiction 17(2), 1\u201318 (1993)","DOI":"10.1016\/0895-7177(93)90236-R"},{"issue":"3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M. Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math.\u00a038(3), 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."},{"key":"15_CR24","unstructured":"Zenklusen, R.: Matching interdiction. CoRR, abs\/0804.3583 (2008)"},{"issue":"15","key":"15_CR25","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"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T03:16:30Z","timestamp":1558926990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}