乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:57Z","timestamp":1740109317332,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100009917","name":"U.S. Naval Research Laboratory","doi-asserted-by":"publisher","award":["N00014-18-1-2099"],"id":[{"id":"10.13039\/100009917","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-20-1-0080"],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10107-022-01824-5","type":"journal-article","created":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T16:05:41Z","timestamp":1654272341000},"page":"215-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Vertex downgrading to minimize connectivity"],"prefix":"10.1007","volume":"199","author":[{"given":"Hassene","family":"Aissi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5976-4687","authenticated-orcid":false,"given":"Da Qi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agarwal, A., Alon, N., Charikar, M.S.: Improved approximation for directed cut problems. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing. ACM, pp. 671\u2013680 (2007)","key":"1824_CR1","DOI":"10.1145\/1250790.1250888"},{"doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an $${\\cal{O}} (n^{\\frac{1}{4}}$$) approximation for densest k-subgraph. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing. ACM, pp. 201\u2013210 (2010)","key":"1824_CR2","DOI":"10.1145\/1806689.1806719"},{"key":"1824_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/0-306-48109-X_3","volume-title":"Network Interdiction and Stochastic Integer Programming","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. In: Woodruff, D.L. (ed.) Network Interdiction and Stochastic Integer Programming, vol. 26, pp. 51\u201368. Springer, Berlin (2003)"},{"issue":"3","key":"1824_CR4","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G C\u0103linescu","year":"2000","unstructured":"C\u0103linescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. J. Comput. Syst. Sci. 60(3), 564\u2013574 (2000)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Chekuri, C., Madan, V.: Simple and fast rounding algorithms for directed and node-weighted multiway cut. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 797\u2013807 (2016)","key":"1824_CR5","DOI":"10.1137\/1.9781611974331.ch57"},{"issue":"1","key":"1824_CR6","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1287\/moor.2016.0798","volume":"42","author":"SR Chestnut","year":"2016","unstructured":"Chestnut, S.R., Zenklusen, R.: Interdicting structured combinatorial optimization problems with $$\\{$$0, 1$$\\}$$-objectives. Math. Oper. Res. 42(1), 144\u2013166 (2016)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1824_CR7","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"},{"issue":"1","key":"1824_CR8","first-page":"2","volume":"12","author":"J Chuzhoy","year":"2016","unstructured":"Chuzhoy, J., Makarychev, Y., Vijayaraghavan, A., Zhou, Y.: Approximation algorithms and hardness of the k-route cut problem. ACM Trans. Algorithms (TALG) 12(1), 2 (2016)","journal-title":"ACM Trans. Algorithms (TALG)"},{"unstructured":"Chuzoy, J.: Flows, cuts and integral routing in graphs\u2014an approximation algorithmist\u2019s perspective. In: Proceedings of of the International Congress of Mathematicians","key":"1824_CR9"},{"doi-asserted-by":"crossref","unstructured":"Feige, U.: Relations between average case complexity and approximation complexity. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing. ACM, pp. 534\u2013543 (2002)","key":"1824_CR10","DOI":"10.1145\/509907.509985"},{"issue":"2","key":"1824_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N Garg","year":"1996","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi) cut theorems and their applications. SIAM J. Comput. 25(2), 235\u2013251 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1824_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0196-6774(03)00111-1","volume":"50","author":"N Garg","year":"2004","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in node weighted graphs. J. Algorithms 50(1), 49\u201361 (2004)","journal-title":"J. Algorithms"},{"issue":"4","key":"1824_CR13","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1002\/nav.3800250412","volume":"25","author":"B Golden","year":"1978","unstructured":"Golden, B.: A problem in network interdiction. Naval Res. Log. Q. 25(4), 711\u2013713 (1978)","journal-title":"Naval Res. Log. Q."},{"key":"1824_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107282094","volume-title":"A Gentle Introduction to Optimization","author":"B Guenin","year":"2014","unstructured":"Guenin, B., K\u00f6nemann, J., Tuncel, L.: A Gentle Introduction to Optimization. Cambridge University Press, Cambridge (2014)"},{"unstructured":"Gupta, A., O\u2019Donnell, R.: Lecture 18 on Multicuts. Lecture Notes for 15-854(B): Advanced Approximation Algorithms, Spring (2008)","key":"1824_CR15"},{"doi-asserted-by":"crossref","unstructured":"Guruganesh, G., Sanita, L., Swamy, C.: Improved region-growing and combinatorial algorithms for k-route cut problems. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 676\u2013695 (2015)","key":"1824_CR16","DOI":"10.1137\/1.9781611973730.46"},{"unstructured":"Harris, T.E., Ross, F.S.: Fundamentals of a method for evaluating rail net capacities. Technical report, Santa Monica, California (1955)","key":"1824_CR17"},{"issue":"2","key":"1824_CR18","first-page":"97","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli, E., Wood, R.K.: Shortest-path network interdiction. Netw. Int. J. 40(2), 97\u2013111 (2002)","journal-title":"Netw. Int. J."},{"issue":"4","key":"1824_CR19","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/S0097539705447037","volume":"36","author":"S Khot","year":"2006","unstructured":"Khot, S.: Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J. Comput. 36(4), 1025\u20131071 (2006)","journal-title":"SIAM J. Comput."},{"unstructured":"Linhares, A., Swamy, C.: Improved algorithms for MST and metric-tsp interdiction. In: Proceedings of 44th International Colloquium on Automata, Languages, and Programming, vol. 32, pp. 1\u201314 (2017)","key":"1824_CR20"},{"issue":"2","key":"1824_CR21","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1137\/S009753979732147X","volume":"31","author":"J Naor","year":"2001","unstructured":"Naor, J., Zosin, L.: A 2-approximation algorithm for the directed multiway cut problem. SIAM J. Comput. 31(2), 477\u2013482 (2001)","journal-title":"SIAM J. Comput."},{"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. IEEE, pp. 86\u201392 (2000)","key":"1824_CR22"},{"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\u201993, New York, NY, USA. ACM, pp. 776\u2013785 (1993)","key":"1824_CR23","DOI":"10.1145\/167088.167286"},{"issue":"3","key":"1824_CR24","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s101070100259","volume":"91","author":"A Schrijver","year":"2002","unstructured":"Schrijver, A.: On the history of the transportation and maximum flow problems. Math. Program. 91(3), 437\u2013445 (2002)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Sharma, A., Vondr\u00e1k, J.: Multiway cut, pairwise realizable distributions, and descending thresholds. In: STOC (2014)","key":"1824_CR25","DOI":"10.1145\/2591796.2591866"},{"issue":"2","key":"1824_CR26","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. Math. Comput. Model. 17(2), 1\u201318 (1993)","journal-title":"Math. Comput. Model."},{"doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: Matching interdiction. Discrete Appl. Math. 145(15), (2010)","key":"1824_CR27","DOI":"10.1016\/j.dam.2010.06.006"},{"doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: Network flow interdiction on planar graphs. Discrete Appl. Math. 158(13), (2010)","key":"1824_CR28","DOI":"10.1016\/j.dam.2010.04.008"},{"doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: Connectivity interdiction. Oper. Res. Lett. 42(67), 450\u2013454 (2014)","key":"1824_CR29","DOI":"10.1016\/j.orl.2014.07.010"},{"doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: An $$\\cal{O} (1)$$ approximation for minimum spanning tree interdiction. In: Proceedings of 56th Annual IEEE Symposium on Foundations of Computer Science, pp. 709\u2013728 (2015)","key":"1824_CR30","DOI":"10.1109\/FOCS.2015.49"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01824-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01824-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01824-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T17:29:01Z","timestamp":1682098141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01824-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,3]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1824"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01824-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2022,6,3]]},"assertion":[{"value":"25 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}