{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:56Z","timestamp":1725664136026},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_264","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:09:54Z","timestamp":1330243794000},"page":"333-342","source":"Crossref","is-referenced-by-count":2,"title":["Multicommodity flows in even, planar networks"],"prefix":"10.1007","author":[{"given":"Karsten","family":"Weihe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Frederickson","year":"1987","unstructured":"G.N. Frederickson (1987): Fast algorithms for shortest paths in planar graphs with applications. SIAM J. Comput. 16, 1004\u20131022.","journal-title":"SIAM J. Comput."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"H.N. Gabow and R.E. Tarjan (1985): A linear-time algorithm for a special case of disjoint set union. J. Comp. Syst. Sci. 30, 209\u2013221.","journal-title":"J. Comp. Syst. Sci."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"A.V. Goldberg and R.E. Tarjan (1988): A new approach to the maximum flow problem. J. ACM 35, 921\u2013940.","journal-title":"J. ACM"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0020-0190(81)90120-4","volume":"113","author":"R. Hassin","year":"1981","unstructured":"R. Hassin (1981): Maximum flow in (s,t) planar networks. Inf. Proc. Letters 113, p. 107.","journal-title":"Inf. Proc. Letters"},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/net.3230140204","volume":"14","author":"R. Hassin","year":"1984","unstructured":"R. Hassin (1984): On multicommodity flows in planar graphs. Networks 14, 225\u2013235.","journal-title":"Networks"},{"key":"36_CR6","unstructured":"T.C. Hu (1969): Integer programming and network flows. Addison-Wesley."},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0208012","volume":"8","author":"A. Itai","year":"1979","unstructured":"A. Itai and Y. Shiloach (1979): Maximum flow in planar networks. SIAM J. Comput. 8, 135\u2013150.","journal-title":"SIAM J. Comput."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/0214023","volume":"14","author":"K. Matsumuto","year":"1985","unstructured":"K. Matsumuto, T. Nishizeki and N. Saito (1985): An efficient algorithm for finding multicommodity flows in planar networks. SIAM J. Comp. 14, 289\u2013302.","journal-title":"SIAM J. Comp."},{"key":"36_CR9","first-page":"178","volume":"42","author":"H. Okamura","year":"1981","unstructured":"H. Okamura and P.D. Seymour (1981): Multicommodity flows in planar graphs. Proc. London Math. Soc. 42, 178\u2013192.","journal-title":"Proc. London Math. Soc."},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00e9. Tardos","year":"1985","unstructured":"\u00e9. Tardos (1985): A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34, 250\u2013256.","journal-title":"Operations Research"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"D. Wagner and K. Weihe (1992): A linear-time algorithm for edge-disjoint paths in planar graphs. Proc. 1st Europ. Symp. Algorithms (ESA '93), Springer Lect. Notes Comp. Sci.","DOI":"10.1007\/3-540-57273-2_73"},{"key":"36_CR12","unstructured":"K. Weihe (1993): Non-crossing path packings in planar graphs with applications. Preprint no. 358\/1993, Fachbereich Mathematik, Technische Universit\u00e4t Berlin."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_264.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:14Z","timestamp":1605629594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_264","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}