{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:47:10Z","timestamp":1773272830135,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441809","type":"print"},{"value":"9783540457497","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_13","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:42:44Z","timestamp":1183549364000},"page":"101-113","source":"Crossref","is-referenced-by-count":27,"title":["On the k-Splittable Flow Problem"],"prefix":"10.1007","author":[{"given":"Georg","family":"Baier","sequence":"first","affiliation":[]},{"given":"Ekkehard","family":"K\u00f6hler","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"13_CR1","unstructured":"Ahuja, R.K., Magnanti, T. L., Orlin, J. B.: Network Flows. Prentice-Hall (1993)"},{"key":"13_CR2","unstructured":"Kleinberg, J.: Approximation Algorithms for Disjoint Paths Problems. PhD thesis, MIT (1996)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science. (1996) 68\u201377","DOI":"10.1109\/SFCS.1996.548465"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Baier, G., K\u00f6hler, E., Skutella, M.: On the k-splittable flow problem. Technical Report 739, Technische Universit\u00e4t Berlin (2002)","DOI":"10.1007\/3-540-45749-6_13"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using greedy algorithms and packing integer programs. In: Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization. (1998)","DOI":"10.1007\/3-540-69346-7_12"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Kolliopoulos, S.G., Stein, C.: Improved approximation algorithms for unsplittable flow problems. In: Procceedings of the 38th Annual Symposium on Foundations of Computer Science. (1997) 426\u2013435","DOI":"10.1109\/SFCS.1997.646131"},{"key":"13_CR7","unstructured":"Kolliopoulos, S.G.: Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems. PhD thesis, Dartmouth College (1998)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1287\/moor.25.2.255.12228","volume":"25","author":"A. Baveja","year":"2000","unstructured":"Baveja, A., Srinivasan, A.: Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research 25 (2000) 255\u2013280","journal-title":"Mathematics of Operations Research"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings of the thirty-first Annual ACM Symposium on Theory of Computing. (1999) 19\u201328","DOI":"10.1145\/301250.301262"},{"key":"13_CR10","unstructured":"Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: 13th Annual ACM-SIAM Symposium on Discrete Algorithms. (2002) 184\u2013193"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Azar, Y., Regev, O.: Strongly polynomial algorithms for the unsplittable flow problem. In: Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization. (2001) 15\u201329","DOI":"10.1007\/3-540-45535-3_2"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s004930050043","volume":"19","author":"Y. Dinitz","year":"1999","unstructured":"Dinitz, Y., Garg, N., Goemans, M. X.: On the single-source unsplittable flow problem. Combinatorica 19 (1999) 17\u201341","journal-title":"Combinatorica"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s101070100260","volume":"91","author":"M. Skutella","year":"2002","unstructured":"Skutella, M.: Approximating the single source unsplittable min-cost flow problem. Mathematical Programming 91 (2002) 493\u2013514","journal-title":"Mathematical Programming"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Bagchi, A., Chaudhary, A., Scheideler, C., Kolman, P.: Algorithms for faulttolerant routing in circuit switched networks. In: Fourteenth ACM Symposium on Parallel Algorithms and Architectures. (2002) To appear","DOI":"10.1145\/564870.564915"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Krysta, P., Sanders, P., V\u00f6cking, B.: Scheduling and traffic allocation for tasks with bounded splittability (2002) Manuscript","DOI":"10.1007\/978-3-540-45138-9_44"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (1987) 365\u2013374","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T23:06:29Z","timestamp":1556579189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}