{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T23:04:19Z","timestamp":1768431859275,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642366932","type":"print"},{"value":"9783642366949","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_14","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T06:08:39Z","timestamp":1362982119000},"page":"157-168","source":"Crossref","is-referenced-by-count":14,"title":["Packing Interdiction and Partial Covering Problems"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dinitz","sequence":"first","affiliation":[]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","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, STOC 1993, pp. 776\u2013785 (1993)","DOI":"10.1145\/167088.167286"},{"key":"14_CR2","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 (2003)","DOI":"10.1007\/0-306-48109-X_3"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R. Wood","year":"1993","unstructured":"Wood, R.: Deterministic network interdiction. Mathematical and Computer Modelling\u00a017, 1\u201318 (1993)","journal-title":"Mathematical and Computer Modelling"},{"key":"14_CR4","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 Appl. Math.\u00a0158, 1441\u20131455 (2010)","journal-title":"Discrete Appl. Math."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"D.R. Fulkerson","year":"1977","unstructured":"Fulkerson, D.R., Harding, G.C.: Maximizing Minimum Source-Sink Path Subject To A Budget Constraint. Mathematical Programming\u00a013, 116\u2013118 (1977)","journal-title":"Mathematical Programming"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Israeli, E., Wood, R.K.: Shortest-path network interdiction. Networks\u00a040, 2002 (2002)","DOI":"10.1002\/net.10039"},{"key":"14_CR7","unstructured":"Frederickson, G.N., Solis-Oba, R.: Increasing the weight of minimum spanning trees. In: SODA 1996, pp. 539\u2013546 (1996)"},{"key":"14_CR8","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 Appl. Math.\u00a0158, 1676\u20131690 (2010)","journal-title":"Discrete Appl. Math."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"4306","DOI":"10.1016\/j.disc.2009.01.006","volume":"309","author":"R. Zenklusen","year":"2009","unstructured":"Zenklusen, R., Ries, B., Picouleau, C., de Werra, D., Costa, M.C., Bentz, C.: Blockers and transversals. Discrete Mathematics\u00a0309, 4306\u20134314 (2009)","journal-title":"Discrete Mathematics"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-13520-0_25","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S.P. Kasiviswanathan","year":"2010","unstructured":"Kasiviswanathan, S.P., Pan, F.: Matrix Interdiction Problem. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 219\u2013231. Springer, Heidelberg (2010)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00453-009-9317-0","volume":"59","author":"J. K\u00f6nemann","year":"2011","unstructured":"K\u00f6nemann, J., Parekh, O., Segev, D.: A unified approach to approximating partial covering problems. Algorithmica\u00a059, 489\u2013509 (2011)","journal-title":"Algorithmica"},{"key":"14_CR12","unstructured":"Kearns, M.J.: The computational complexity of machine learning. PhD thesis, Harvard University, Cambridge, MA, USA (1990)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(97)00182-8","volume":"64","author":"P. Slav\u00edk","year":"1997","unstructured":"Slav\u00edk, P.: Improved performance of the greedy algorithm for partial cover. Inf. Process. Lett.\u00a064, 251\u2013254 (1997)","journal-title":"Inf. Process. Lett."},{"key":"14_CR14","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, 137\u2013144 (2001)","journal-title":"J. Algorithms"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0167-6377(99)00045-0","volume":"25","author":"T. Fujito","year":"1999","unstructured":"Fujito, T.: On approximation of the submodular set cover problem. Oper. Res. Lett.\u00a025, 169\u2013174 (1999)","journal-title":"Oper. Res. Lett."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R. Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms\u00a02, 198\u2013203 (1981)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36694-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T13:51:40Z","timestamp":1557582700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}