{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:53:01Z","timestamp":1648687981329},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T00:00:00Z","timestamp":1178150400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10288-007-0040-x","type":"journal-article","created":{"date-parts":[[2007,5,2]],"date-time":"2007-05-02T14:52:09Z","timestamp":1178117529000},"page":"89-92","source":"Crossref","is-referenced-by-count":0,"title":["Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity"],"prefix":"10.1007","volume":"6","author":[{"given":"C\u00e9dric","family":"Bentz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,5,3]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Bentz C (2005) Edge disjoint paths and max integral multiflow\/min multicut theorems in planar graphs. In: Proceedings ICGT\u201905, Hy\u00e8res, Electronic Notes in Discrete Mathematics 22:55\u201360","DOI":"10.1016\/j.endm.2005.06.010"},{"key":"40_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.orl.2006.03.005","volume":"35","author":"C Bentz","year":"2007","unstructured":"Bentz C (2007) The maximum integer multiterminal flow problem in directed graphs. Oper Res Lett 35:195\u2013200","journal-title":"Oper Res Lett"},{"key":"40_CR3","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1016\/j.ejor.2006.03.007","volume":"178","author":"C Bentz","year":"2007","unstructured":"Bentz C, Costa MC, Picouleau C, Zrikem M (2007a) The shortest multipaths problem in a capacitated dense channel. Eur J Oper Res 178:926\u2013931","journal-title":"Eur J Oper Res"},{"key":"40_CR4","first-page":"36","volume":"5","author":"C Bentz","year":"2007","unstructured":"Bentz C, Costa MC, Roupin F (2007b) Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs. J Discret\u00a0algorithms 5:36\u201354","journal-title":"J Discret\u00a0algorithms"},{"key":"40_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00453-003-1061-2","volume":"38","author":"D Chen","year":"2004","unstructured":"Chen D, Wu X (2004) Efficient algorithms for k-terminal cuts on planar graphs. Algorithmica 38:299\u2013316","journal-title":"Algorithmica"},{"key":"40_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2003.10.037","volume":"162","author":"MC Costa","year":"2005","unstructured":"Costa MC, L\u00e9tocart L, Roupin F (2005) Minimal multicut and maximal integer multiflow: a survey. Eur J Oper Res 162:55\u201369","journal-title":"Eur J Oper Res"},{"key":"40_CR7","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus E, Johnson D, Papadimitriou C, Seymour P, Yannakakis M (1994) The complexity of multiterminal cuts. SIAM J Comput 23:864\u2013894","journal-title":"SIAM J Comput"},{"key":"40_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L Ford","year":"1956","unstructured":"Ford L, Fulkerson D (1956) Maximal flow through a network. Can J Math 8:339\u2013404","journal-title":"Can J Math"},{"key":"40_CR9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1993.1041","volume":"15","author":"M Formann","year":"1993","unstructured":"Formann M, Wagner D, Wagner F (1993) Routing through a dense channel with minimum total wire length. J Algorithms 15:267\u2013283","journal-title":"J Algorithms"},{"key":"40_CR10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02579432","volume":"2","author":"A Frank","year":"1982","unstructured":"Frank A (1982) Disjoint paths in a rectilinear grid. Combinatorica 2:361\u2013371","journal-title":"Combinatorica"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Garg N, Vazirani V, Yannakakis M (1994) Multiway cuts in directed and node weighted graphs. In: Proceedings ICALP, lecture notes in computer science 820:487\u2013498","DOI":"10.1007\/3-540-58201-0_92"},{"key":"40_CR12","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N Garg","year":"1996","unstructured":"Garg N, Vazirani V, Yannakakis M (1996) Approximate max-flow min-(multi)cut theorems and their applications. SIAM J Comput 25:235\u2013251","journal-title":"SIAM J Comput"},{"key":"40_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N Garg","year":"1997","unstructured":"Garg N, Vazirani V, Yannakakis M (1997) Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18:3\u201320","journal-title":"Algorithmica"},{"key":"40_CR14","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0022-0000(03)00066-7","volume":"67","author":"V Guruswami","year":"2003","unstructured":"Guruswami V, Khanna S, Rajaraman R, Shepherd B, Yannakakis M (2003) Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J Comput Syst Sci 67: 473\u2013496","journal-title":"J Comput Syst Sci"},{"key":"40_CR15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.jctb.2005.07.002","volume":"96","author":"JCM Keijsper","year":"2006","unstructured":"Keijsper JCM, Pendavingh RA, Stougie L (2006) A linear programming formulation of Mader\u2019s edge- disjoint paths problem. J Comb Theory Ser B 96:159\u2013163","journal-title":"J Comb Theory Ser B"},{"key":"40_CR16","unstructured":"Korte B, Lov\u00e1sz L, Pr\u00f6mel HJ, Schrijver A (eds) (1990) Paths, flows and VLSI-layout. Algorithms and combinatorics 9, Springer, Berlin"},{"key":"40_CR17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H Okamura","year":"1981","unstructured":"Okamura H, Seymour P (1981) Multicommodity flows in planar graphs. J Comb Theory Ser B 31:75\u201381","journal-title":"J Comb Theory Ser B"},{"key":"40_CR18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(93)90228-2","volume":"47","author":"E Tardos","year":"1993","unstructured":"Tardos E, Vazirani V (1993) Improved bounds for the max-flow min-multicut ratio for planar and K r,r -free graphs. Inform Process Lett 47:77\u201380","journal-title":"Inform Process Lett"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0040-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0040-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0040-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:54Z","timestamp":1559131974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0040-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["40"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0040-x","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,3]]}}}