{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:52:14Z","timestamp":1725475934167},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340751"},{"type":"electronic","value":"9783540340768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751595_78","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T14:27:59Z","timestamp":1147357679000},"page":"738-747","source":"Crossref","is-referenced-by-count":0,"title":["The Maximum Integer Multiterminal Flow Problem"],"prefix":"10.1007","author":[{"given":"C\u00e9dric","family":"Bentz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"78_CR1","volume-title":"Network Flows \u2013 Theory, Algorithms, and Applications","author":"A.K. Ahuja","year":"1993","unstructured":"Ahuja, A.K., Magnanti, T.L., Orlin, J.B.: Network Flows \u2013 Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"78_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, M., Zhang, L.: Hardness of the undirected edge-disjoint paths problem. In: Proceedings STOC 2005, pp. 276\u2013283 (2005)","DOI":"10.1145\/1060590.1060632"},{"key":"78_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<102::AID-NET3>3.0.CO;2-X","volume":"34","author":"D. Bertsimas","year":"1999","unstructured":"Bertsimas, D., Teo, C.-P., Vohra, R.: Analysis of LP relaxations for multiway and multicut problems. Networks\u00a034, 102\u2013114 (1999)","journal-title":"Networks"},{"key":"78_CR4","doi-asserted-by":"crossref","unstructured":"Billionnet, A., Costa, M.-C.: Multiway cut and integer flow problems in trees. In: Liberti, L., Maffioli, F. (eds.) CTW 2004 Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, vol.\u00a017, pp. 105\u2013109 (2004)","DOI":"10.1016\/j.endm.2004.03.016"},{"key":"78_CR5","doi-asserted-by":"crossref","unstructured":"C\u01celinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for Multiway Cut. In: Proceedings STOC 1998, pp. 48\u201352 (1998)","DOI":"10.1145\/276698.276711"},{"key":"78_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-003-1061-2","volume":"38","author":"D.Z. Chen","year":"2004","unstructured":"Chen, D.Z., Wu, X.: Efficient algorithms for k-terminal cuts on planar graphs. Algorithmica\u00a038, 299\u2013316 (2004)","journal-title":"Algorithmica"},{"key":"78_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/net.3230210106","volume":"21","author":"S. Chopra","year":"1991","unstructured":"Chopra, S., Rao, M.R.: On the multiway cut polyhedron. Networks\u00a021, 51\u201389 (1991)","journal-title":"Networks"},{"key":"78_CR8","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 Journal of Operational Research\u00a0162, 55\u201369 (2005)","journal-title":"European Journal of Operational Research"},{"key":"78_CR9","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal On Computing\u00a023, 864\u2013894 (1994)","journal-title":"SIAM Journal On Computing"},{"key":"78_CR10","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing\u00a05, 691\u2013703 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"78_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal Flow Through a Network. Canadian Journal of Mathematics\u00a08, 339\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"key":"78_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S0895480195287723","volume":"10","author":"A. Frank","year":"1997","unstructured":"Frank, A., Karzanov, A., Seb\u00f6, A.: On integer multiflow maximization. SIAM J. Discrete Mathematics\u00a010, 158\u2013170 (1997)","journal-title":"Discrete Mathematics"},{"key":"78_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/3-540-58201-0_92","volume-title":"Automata, Languages, and Programming","author":"N. Garg","year":"1994","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 487\u2013498. Springer, Heidelberg (1994)"},{"key":"78_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica\u00a018, 3\u201320 (1997)","journal-title":"Algorithmica"},{"key":"78_CR15","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings STOC 1999, pp. 19\u201328 (1999)","DOI":"10.1145\/301250.301262"},{"key":"78_CR16","doi-asserted-by":"crossref","unstructured":"Karger, D., Klein, P., Stein, C., Thorup, M., Young, N.: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. In: Proceedings STOC 1999, pp. 668\u2013678 (1999)","DOI":"10.1145\/301250.301430"},{"key":"78_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jctb.2005.07.002","volume":"96","author":"J.C.M. Keijsper","year":"2006","unstructured":"Keijsper, J.C.M., Pendavingh, R.A., Stougie, L.: A linear programming formulation of Mader\u2019s edge-disjoint paths problem. Journal of Combinatorial Theory, Series B\u00a096, 159\u2013163 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"78_CR18","doi-asserted-by":"crossref","unstructured":"Naor, J., Zosin, L.: A 2-approximation algorithm for the directed multiway cut problem. In: Proceedings FOCS 1997, pp. 548\u2013553 (1997)","DOI":"10.1109\/SFCS.1997.646144"},{"key":"78_CR19","volume-title":"Algorithms and Combinatorics","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Algorithms and Combinatorics, vol.\u00a024. Springer, Heidelberg (2003)"},{"key":"78_CR20","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1006\/jagm.2000.1148","volume":"39","author":"W.-C. Yeh","year":"2001","unstructured":"Yeh, W.-C.: A Simple Algorithm for the Planar Multiway Cut Problem. Journal of Algorithms\u00a039, 68\u201377 (2001)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751595_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:00:15Z","timestamp":1619506815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751595_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340751","9783540340768"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11751595_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}