{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T09:53:29Z","timestamp":1781776409763,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540372714","type":"print"},{"value":"9783540372738","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11816157_107","type":"book-chapter","created":{"date-parts":[[2006,8,31]],"date-time":"2006-08-31T11:46:55Z","timestamp":1157024815000},"page":"895-900","source":"Crossref","is-referenced-by-count":2,"title":["Further Research on Node Based Bottleneck Improvement Problem for Multicut"],"prefix":"10.1007","author":[{"given":"Xiucui","family":"Guan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"107_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2003.10.037","volume":"162","author":"M.C. Costa","year":"2005","unstructured":"Costa, M.C., L\u00e9tocart, L., Roupin, F.: Minimal Multicut and Maximal Integer Multiflow: A Survey. European J. Oper. Res.\u00a0162, 55\u201369 (2005)","journal-title":"European J. Oper. Res."},{"key":"107_CR2","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\u00a050, 49\u201361 (2004)","journal-title":"J. Algorithms"},{"key":"107_CR3","unstructured":"Guan, X.C., Zhang, J.Z.: A Class of Node Based Bottleneck Improvement Problems. European J. Oper. Res. Available online, May 17 (2005)"},{"key":"107_CR4","unstructured":"Guan, X.C., Zhang, J.Z.: Improving Multicut in Directed Trees by Upgrading Nodes. European J. Oper. Res (2005) (Accepted)"},{"key":"107_CR5","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"J.X. Hao","year":"1994","unstructured":"Hao, J.X., Orlin, J.B.: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. J. Algorithms\u00a017, 424\u2013446 (1994)","journal-title":"J. Algorithms"},{"key":"107_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1009798010579","volume":"2","author":"S.O. Krumke","year":"1998","unstructured":"Krumke, S.O., Marathe, M.V., et al.: Approximation Algorithms for Certain Network Improvement Problems. J. Comb. Optim.\u00a02, 257\u2013288 (1998)","journal-title":"J. Comb. Optim."},{"key":"107_CR7","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1006\/jagm.1999.1021","volume":"33","author":"S.O. Krumke","year":"1999","unstructured":"Krumke, S.O., Marathe, M.V., Noltemeier, H., et al.: Improving Minimum Cost Spanning Trees by Upgrading Nodes. J. Algorithms\u00a033, 92\u2013111 (1999)","journal-title":"J. Algorithms"},{"key":"107_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(00)00222-5","volume":"108","author":"S.O. Krumke","year":"2001","unstructured":"Krumke, S.O., Marathe, M.V., Noltemeier, H., et al.: Upgrading Bottleneck Constrained Forests. Discrete Appl. Math.\u00a0108, 129\u2013142 (2001)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11816157_107.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:28:36Z","timestamp":1619508516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11816157_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372714","9783540372738"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11816157_107","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}