{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:50:24Z","timestamp":1773762624783,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540322078","type":"print"},{"value":"9783540322085","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_19","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:26:35Z","timestamp":1139995595000},"page":"244-257","source":"Crossref","is-referenced-by-count":8,"title":["Approximation and Complexity of k\u2013Splittable Flows"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Koch","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]},{"given":"Ines","family":"Spenke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Network Flows. Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods\u00a08, 277\u2013284 (1987)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"key":"19_CR4","first-page":"265","volume-title":"Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures","author":"A. Bagchi","year":"2002","unstructured":"Bagchi, A., Chaudhary, A., Kolman, P., Scheideler, C.: Algorithms for faulttolerant routing in circuit-switched networks. In: Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 265\u2013274. ACM Press, New York (2002)"},{"key":"19_CR5","unstructured":"Baier, G.: Flows with Path Restrictions. PhD thesis, TU Berlin (2003)"},{"key":"19_CR6","doi-asserted-by":"publisher","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.: On the k-splittable flow problem. Algorithmica\u00a042, 231\u2013248 (2005)","journal-title":"Algorithmica"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs of bounded treewidth. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol.\u00a0317, pp. 105\u2013118. Springer, Heidelberg (1988)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"key":"19_CR10","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":"19_CR11","unstructured":"Hagerup, T., Katajainen, J., Nishimura, N., Ragde, P.: Characterizations of k-terminal flow networks and computing network flows in partial k-trees. In: Proceedings 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 641\u2013649 (1995)"},{"key":"19_CR12","unstructured":"Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. PhD thesis, M.I.T (1996)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-45138-9_44","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P. Krysta","year":"2003","unstructured":"Krysta, P., Sanders, P., V\u00f6cking, B.: Scheduling and traffic allocation for tasks with bounded splittability. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 500\u2013510. Springer, Heidelberg (2003)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-540-30140-0_47","volume-title":"Algorithms \u2013 ESA 2004","author":"M. Martens","year":"2004","unstructured":"Martens, M., Skutella, M.: Flows on few paths: Algorithms and lower bounds. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 520\u2013531. Springer, Heidelberg (2004)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. ii: algorithmic aspects of treewidth. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"19_CR16","unstructured":"Scheffler, P.: A practical linear time algorithm for disjoint paths in graphs with bounded tree\u2013width. Technical Report 396, FU Berlin, Fachbereich 3 Mathematik (1994)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:23Z","timestamp":1619507663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11671411_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}