{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:19:31Z","timestamp":1725470371607},"reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540325376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32539-5_47","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T10:54:52Z","timestamp":1157972092000},"page":"297-302","source":"Crossref","is-referenced-by-count":7,"title":["Length-Bounded and Dynamic k-Splittable Flows"],"prefix":"10.1007","author":[{"given":"Maren","family":"Martens","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"A. Bagchi. Efficient Strategies for Topics in Internet Algorithmics. PhD thesis, The Johns Hopkins University, October 2002."},{"key":"47_CR2","unstructured":"G. Baier. Flows with Path Restrictions. PhD thesis, TU Berlin, 2003."},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00453-005-1167-9","volume":"42","author":"G. Baier","year":"2005","unstructured":"G. Baier, E. K\u00f6hler, and M. Skutella. On the k-splittable flow problem. Algorithmica, 42:231\u2013248, 2005.","journal-title":"Algorithmica"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"L. Fleischer and M. Skutella. The quickest multicommodity flow problem. In Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, pages 36\u201353, 2002.","DOI":"10.1007\/3-540-47867-1_4"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L. R. Ford","year":"1958","unstructured":"L. R. Ford and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6, pages 419\u2013433, 1958.","journal-title":"Operations Research"},{"key":"47_CR6","unstructured":"J. M. Kleinberg. Approximation Algorithms for Disjoint Path Problems. PhD thesis, Massachusetts Institute of Technology, May 1996."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32539-5_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:45Z","timestamp":1605646425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32539-5_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540325376"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-32539-5_47","relation":{},"subject":[]}}