{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:01Z","timestamp":1725564601758},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_36","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T15:01:54Z","timestamp":1283958114000},"page":"406-417","source":"Crossref","is-referenced-by-count":0,"title":["Integral Symmetric 2-Commodity Flows"],"prefix":"10.1007","author":[{"given":"Aubin","family":"Jarry","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Chanas, P.: R\u00e9seaux ATM: Conception et optimisation. PhD thesis, Universit\u00e9 de Grenoble, France T\u00e9l\u00e9com CNET (June 1998)"},{"issue":"4","key":"36_CR2","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 J. Comput.\u00a05(4), 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"key":"36_CR3","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science\u00a0(10), 111\u2013121 (1980)","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"36_CR5","first-page":"211","volume-title":"International Colloquium on Structural Information and Communication Complexity \u2013SIROCCO","author":"A. Jarry","year":"2002","unstructured":"Jarry, A., P\u00e9rennes, S.: Disjoint Paths in Symmetric Digraphs. In: International Colloquium on Structural Information and Communication Complexity \u2013SIROCCO, Andros, Greece, June 2002, pp. 211\u2013222. Carleton, Ottawa (2002)"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: On the complexity of combinatorial problems. Networks\u00a0(5), 45\u201368 (1975)","DOI":"10.1002\/net.1975.5.1.45"},{"issue":"31","key":"36_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"B","author":"H. Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. Journal of Combinatorial Theory\u00a0B(31), 75\u201381 (1981)","journal-title":"Journal of Combinatorial Theory"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors XIII. The Disjoint Paths Problem. J. Combin. Theory Ser. B\u00a063, 65\u2013110 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Operation Research\u00a034, 250\u2013256 (1986)","journal-title":"Operation Research"},{"key":"36_CR10","unstructured":"Vygen, J.: Disjoint paths. Technical Report 94816, Research Institute for Discrete Mathematics, University of Bonn (February 1994) (updated September 1998)"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Vygen, J.: NP-Completeness of Some Edge-Disjoint Paths Problems. Discrete Applied Mathematics\u00a0(61), 83\u201390 (1995)","DOI":"10.1016\/0166-218X(93)E0177-Z"},{"issue":"15","key":"36_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01294465","volume":"1","author":"D. Wagner","year":"1995","unstructured":"Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica\u00a01(15), 135\u2013150 (1995)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T01:33:43Z","timestamp":1559612023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}