{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T01:31:25Z","timestamp":1648603885933},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T00:00:00Z","timestamp":1347494400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00186-012-0402-9","type":"journal-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T21:21:49Z","timestamp":1347484909000},"page":"381-391","source":"Crossref","is-referenced-by-count":0,"title":["A polynomial time approximation algorithm for the two-commodity splittable flow problem"],"prefix":"10.1007","volume":"77","author":[{"given":"Elke","family":"Eisenschmidt","sequence":"first","affiliation":[]},{"given":"Utz-Uwe","family":"Haus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,13]]},"reference":[{"key":"402_CR1","doi-asserted-by":"crossref","unstructured":"Baier G, K\u00f6hler E, Skutella M (2002) On the k-splittable flow problem. In: Algorithms\u2014ESA 2002. Lecture notes in computer science, vol. 2461. Springer, Berlin, pp 101\u2013113. doi: 10.1007\/3-540-45749-6_13","DOI":"10.1007\/3-540-45749-6_13"},{"key":"402_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00453-005-1167-9","volume":"42","author":"G Baier","year":"2005","unstructured":"Baier G, K\u00f6hler E, Skutella M (2005) The k-splittable flow problem. Algorithmica 42: 231\u2013248. doi: 10.1007\/s00453-005-1167-9","journal-title":"Algorithmica"},{"issue":"4","key":"402_CR3","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even S, Itai A, Shamir A (1976) On the complexity of timetable and multicommodity flow problems. SIAM J Comput 5(4): 691\u2013703. doi: 10.1137\/0205048","journal-title":"SIAM J Comput"},{"issue":"3","key":"402_CR4","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"11","author":"TC Hu","year":"1963","unstructured":"Hu TC (1963) Multi-commodity network flows. Oper Res 11(3): 344\u2013360. doi: 10.1287\/opre.11.3.344","journal-title":"Oper Res"},{"key":"402_CR5","unstructured":"Kleinberg JM (1996) Approximation algorithms for disjoint paths problems. Ph.d. thesis, Massachusetts Institute of Technology"},{"key":"402_CR6","unstructured":"Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency. Vol. C, Algorithms and Combinatorics, vol. 24. Springer, Berlin"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0402-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0402-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0402-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:33:30Z","timestamp":1558622010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0402-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,13]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["402"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0402-9","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,13]]}}}