{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:10Z","timestamp":1725566290527},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_47","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"520-531","source":"Crossref","is-referenced-by-count":7,"title":["Flows on Few Paths: Algorithms and Lower Bounds"],"prefix":"10.1007","author":[{"given":"Maren","family":"Martens","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","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, pp. 15\u201329 (2001)","DOI":"10.1007\/3-540-45535-3_2"},{"key":"47_CR2","unstructured":"Bagchi, A.: Efficient Strategies for Topics in Internet Algorithmics. PhD thesis, The Johns Hopkins University (October 2002)"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Bagchi, A., Chaudary, A., Scheideler, C., Kolman, P.: Algorithms for faulttolerant routing in circuit switched networks. In: Fourteenth ACM Symposium on Parallel Algorithms and Architectures (2002)","DOI":"10.1145\/564913.564915"},{"key":"47_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-45749-6_13","volume-title":"Algorithms - ESA 2002","author":"G. Baier","year":"2002","unstructured":"Baier, G., K\u00f6hler, E., Skutella, M.: On the k-splittable flow problem. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 101\u2013113. Springer, Heidelberg (2002)"},{"key":"47_CR5","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\u00a025, 255\u2013280 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"47_CR6","unstructured":"Chekuri, C., Khanna, S.: Edge disjoint paths revisited. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003)"},{"key":"47_CR7","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\u00a019, 17\u201341 (1999)","journal-title":"Combinatorica"},{"key":"47_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2013Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP\u2013Completeness. Freeman, San Francisco (1979)"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 19\u201328 (1999)","DOI":"10.1145\/301250.301262"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Rubinfeld, R.: Short paths in expander graphs. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 86\u201395 (1996)","DOI":"10.1109\/SFCS.1996.548467"},{"key":"47_CR11","unstructured":"Kleinberg, J.M.: Approximation Algorithms for Disjoint Path Problems. PhD thesis, Massachusetts Institute of Technology (May 1996)"},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1137\/S0097539799355314","volume":"31","author":"S.G. Kolliopoulos","year":"2002","unstructured":"Kolliopoulos, S.G., Stein, C.: Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing\u00a031, 919\u2013946 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"47_CR13","unstructured":"Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 184\u2013193 (2002)"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences\u00a037, 130\u2013143 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"47_CR16","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\u00a091, 493\u2013514 (2002)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:44:38Z","timestamp":1605761078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}