{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T21:31:17Z","timestamp":1725658277342},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642282089"},{"type":"electronic","value":"9783642282096"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28209-6_8","type":"book-chapter","created":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T19:50:08Z","timestamp":1328730608000},"page":"86-100","source":"Crossref","is-referenced-by-count":1,"title":["Evader Interdiction and Collateral Damage"],"prefix":"10.1007","author":[{"given":"Matthew P.","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Gutfraind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes. Technical report, University of Maryland, College Park, MD, USA (1995)"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","volume":"1","author":"H.W. Corley","year":"1982","unstructured":"Corley, H.W., Sha, D.Y.: Most vital links and nodes in weighted networks. Operations Research Letters\u00a01(4), 157\u2013160 (1982)","journal-title":"Operations Research Letters"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S., Sviridenko, M.: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Transactions on Algorithms\u00a04(3) (2008)","DOI":"10.1145\/1367064.1367074"},{"key":"8_CR4","unstructured":"Even, S.: Graph Algorithms. Computer Science Press (1979)"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Computing\u00a01(2), 180\u2013187 (1972)","journal-title":"SIAM J. Computing"},{"key":"8_CR7","first-page":"395","volume":"1","author":"K. Glazer","year":"2006","unstructured":"Glazer, K., Rubinstein, A.: A study in the pragmatics of persuasion: A game theoretical approach. Theoretical Economics\u00a01, 395\u2013410 (2006)","journal-title":"Theoretical Economics"},{"key":"8_CR8","unstructured":"Gutfraind, A., Ahmadizadeh, K.: Markovian Network Interdiction and the Four Color Theorem. Review with SIAM J. Discrete Math. (2009), \n                    \n                      http:\/\/arxiv.org\/abs\/0911.4322"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Gutfraind, A., Hagberg, A., Izraelevitz, D., Pan, F.: Interdiction of a Markovian Evader. In: Dell, R., Wood, K. (eds.) Proc. INFORMS Computing Society Conference (January 2011)","DOI":"10.1287\/ics.2011.0020"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-01929-6_9","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A. Gutfraind","year":"2009","unstructured":"Gutfraind, A., Hagberg, A., Pan, F.: Optimal Interdiction of Unreactive Markovian Evaders. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 102\u2013116. Springer, Heidelberg (2009)"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1287\/mnsc.21.3.362","volume":"21","author":"J.H.W. Corley","year":"1974","unstructured":"Corley, J.H.W., Chang, H.: Finding the n most vital nodes in a flow network. Management Science\u00a021(3), 362\u2013364 (1974)","journal-title":"Management Science"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: FOCS, pp. 671\u2013680 (2009)","DOI":"10.1109\/FOCS.2009.31"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"D.B. Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM Journal on Computing\u00a04(1), 77\u201384 (1975)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2\u2009\u2212\u2009\u03b5. J. Comput. Syst. Sci.\u00a074(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-642-02927-1_53","volume-title":"Automata, Languages and Programming","author":"C. Koufogiannakis","year":"2009","unstructured":"Koufogiannakis, C., Young, N.E.: Greedy \u0394-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 634\u2013652. Springer, Heidelberg (2009)"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/nav.3800170302","volume":"17","author":"A.W. McMasters","year":"1970","unstructured":"McMasters, A.W., Mustin, T.M.: Optimal interdiction of a supply network. Naval Research Logistics Quarterly\u00a017(3), 261\u2013268 (1970)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/0604028","volume":"4","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Zemel, E., Hakimi, S.L.: The maximum coverage location problem. SIAM Journal on Algebraic and Discrete Methods\u00a04(2), 253\u2013261 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"4","key":"8_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.ipl.2008.05.007","volume":"108","author":"P. Miettinen","year":"2008","unstructured":"Miettinen, P.: On the positive-negative partial set cover problem. Inf. Process. Lett.\u00a0108(4), 219\u2013221 (2008)","journal-title":"Inf. Process. Lett."},{"key":"8_CR19","first-page":"1","volume-title":"Network Interdiction and Stochastic Integer Programming","author":"F. Pan","year":"2003","unstructured":"Pan, F., Charlton, W.S., Morton, D.P.: Interdicting smuggled nuclear material. In: Woodruff, D. (ed.) Network Interdiction and Stochastic Integer Programming, pp. 1\u201319. Kluwer Academic Publishers, Boston (2003)"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jda.2006.03.008","volume":"5","author":"D. Peleg","year":"2007","unstructured":"Peleg, D.: Approximation algorithms for the label-cover\n                    \n                      \n                    \n                    $_{\\mbox{max}}$\n                   and red-blue set cover problems. J. Discrete Algorithms\u00a05(1), 55\u201364 (2007)","journal-title":"J. Discrete Algorithms"},{"issue":"5","key":"8_CR21","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/mnsc.21.5.531","volume":"21","author":"H.D. Ratliff","year":"1975","unstructured":"Ratliff, H.D., Sicilia, G.T., Lubore, S.H.: Finding the n most vital links in flow networks. Management Science\u00a021(5), 531\u2013539 (1975)","journal-title":"Management Science"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing\u00a03(1), 103\u2013128 (2007)","journal-title":"Theory of Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28209-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T06:30:51Z","timestamp":1556346651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28209-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642282089","9783642282096"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28209-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}