{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:54:12Z","timestamp":1754261652241,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644476","type":"print"},{"value":"9789819644483","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-4448-3_7","type":"book-chapter","created":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:50:46Z","timestamp":1746251446000},"page":"75-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["B-matching interdiction problem on bipartite graphs with unit weight and multi-dimensional budgets"],"prefix":"10.1007","author":[{"given":"Ruiqing","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,4]]},"reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1002\/net.21732","volume":"69","author":"M Afshari Rad","year":"2017","unstructured":"Afshari Rad, M., Kakhki, H.T.: Two extended formulations for cardinality maximum flow network interdiction problem. Networks 69(4), 367\u2013377 (2017)","journal-title":"Networks"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153(1), 235\u2013256 (2007)","journal-title":"Ann. Oper. Res."},{"key":"7_CR3","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. 7801, pp. 157\u2013168. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36694-9_14"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-56686-4_38","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"MR Fellows","year":"1993","unstructured":"Fellows, M.R., Koblitz, N.: Fixed-parameter complexity and cryptography. In: Cohen, G., Mora, T., Moreno, O. (eds.) AAECC 1993. LNCS, vol. 673, pp. 121\u2013131. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56686-4_38"},{"key":"7_CR7","unstructured":"Frederickson, G.N., Solis-Oba, R.: Increasing the weight of minimum spanning trees. In: SODA 1996, pp. 539\u2013546 (1996)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"DR Fulkerson","year":"1977","unstructured":"Fulkerson, D.R., Harding, G.C.: Maximizing minimum source-sink path subject to a budget constraint. Math. Program. 13, 116\u2013118 (1977)","journal-title":"Math. Program."},{"key":"7_CR9","unstructured":"Huang, B., Jebara, T.: Fast $$b$$-matching via sufficient selection belief propagation. In: Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, pp. 361\u2013369. JMLR Workshop and Conference Proceedings (2011)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli, E., Wood, R.K.: Shortest-path network interdiction. Networks 40, 97\u2013111 (2002)","journal-title":"Networks"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/11871842_67","volume-title":"Machine Learning: ECML 2006","author":"T Jebara","year":"2006","unstructured":"Jebara, T., Shchogolev, V.: B-matching for spectral clustering. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 679\u2013686. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_67"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Jebara, T., Wang, J., Chang, S. F.: Graph construction and b-matching for semi-supervised learning. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 441\u2013448 (2009)","DOI":"10.1145\/1553374.1553432"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Math. Program. 32(2), 146\u2013164 (1985)","journal-title":"Math. Program."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Khan, A., et al.: Efficient approximation algorithms for weighted $$b$$-matching. SIAM J. Sci. Comput. 38(5), S593\u2013S619 (2016)","DOI":"10.1137\/15M1026304"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Lau, L. C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization, vol. 46. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511977152"},{"key":"7_CR16","unstructured":"Nemhauser, G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley-Interscience (1999)"},{"key":"7_CR17","unstructured":"Schrijver, A.: Combinatorial Optimization - Polyhedra and Effciency. Springer, New York (2005)"},{"key":"7_CR18","unstructured":"Shaw, B., Jebara, T.: Minimum volume embedding. In: Artificial Intelligence and Statistics, pp. 460\u2013467. PMLR (2007)"},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2019.06.024","volume":"283","author":"JC Smith","year":"2020","unstructured":"Smith, J.C., Song, Y.: A survey of network interdiction models and algorithms. Eur. J. Oper. Res. 283(3), 797\u2013811 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR20","unstructured":"Stackelberg, H.: The Theory of the Market Economy. Oxford University Press (1952)"},{"issue":"13","key":"7_CR21","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. Discret. Math. 309(13), 4306\u20134314 (2009)","journal-title":"Discret. Math."},{"key":"7_CR22","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. 158, 1676\u20131690 (2010)","journal-title":"Discrete Appl. Math."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: An O(1)-approximation for minimum spanning tree interdiction. In: IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 709\u2013728 (2015)","DOI":"10.1109\/FOCS.2015.49"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4448-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:50:54Z","timestamp":1746251454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4448-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644476","9789819644483"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4448-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cocoa2024.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}