{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T10:28:29Z","timestamp":1777544909067,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441861","type":"print"},{"value":"9783540457534","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45753-4_7","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T11:37:09Z","timestamp":1187264229000},"page":"51-66","source":"Crossref","is-referenced-by-count":22,"title":["Approximation Algorithms for the Unsplittable Flow Problem"],"prefix":"10.1007","author":[{"given":"Amit","family":"Chakrabarti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandra","family":"Chekuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anuptam","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"7_CR1","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"N. Alon and J. Spencer. The Probabilistic Method. Wiley Interscience, New York, 1992."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 32\u201340. 1993.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Y. Azar and O. Regev. Strongly polynomial algorithms for the unsplittable flow problem. In Proceedings of the 8th Integer Programming and Combinatorial Optimization Conference. 2001.","DOI":"10.1007\/3-540-45535-3_2"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. S. Naor, and B. Scheiber. A unified approach to approximating resource allocation and scheduling. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 735\u2013744, 2000.","DOI":"10.1145\/335305.335410"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"P. Berman and B. DasGupta. Improvements in throughput maximization for realtime scheduling. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 680\u2013687, 2000.","DOI":"10.1145\/335305.335401"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"T. Bohman and A. M. Frieze. Arc-disjoint paths in expander digraphs. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science. 2001.","DOI":"10.1109\/SFCS.2001.959932"},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1137\/S0097539792232021","volume":"23","author":"A. Z. Broder","year":"1994","unstructured":"A. Z. Broder, A. M. Frieze, and E. Upfal. Existence and construction of edgedisjoint paths on expander graphs. SIAM Journal on Computing, 23(5):976\u2013989, 1994.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"G. Calinescu, A. Chakrabarti, H. Karloff, and Y. Rabani. Improved approximation algorithms for resource allocation. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference, 2002.","DOI":"10.1007\/3-540-47867-1_28"},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1137\/S0097539700366103","volume":"30","author":"A. M. Frieze","year":"2001","unstructured":"A. M. Frieze. Edge-disjoint paths on expander graphs. SIAM Journal on Computing, 30(6):1790\u20131801, 2001.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, and M. Yannakakis. Near-optimal 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":"7_CR11","unstructured":"J. M. Kleinberg. Approximation Algorithms for Disjoint Paths Problems. Ph.D. thesis, MIT, 1996."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"J. M. Kleinberg and R. Rubinfeld. Short paths in expander graphs. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pp. 86\u201395. 1996.","DOI":"10.1109\/SFCS.1996.548467"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"P. Kolman and S. Scheideler. Simple on-line algorithms for the maximum disjoint paths problem. In Proceedings of 13th ACM Symposium on Parallel Algorithms and Architectures. 2001.","DOI":"10.1145\/378580.378586"},{"key":"7_CR14","unstructured":"P. Kolman and S. Scheideler. Improved bounds for the unsplittable flow problem. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 2002."},{"issue":"6","key":"7_CR15","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"F. T. Leighton","year":"1999","unstructured":"F. T. Leighton and S. B. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787\u2013832, 1999. (Preliminary version in 29th Annual Symposium on Foundations of Computer Science, pages 422-431, 1988).","journal-title":"Journal of the ACM"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"C. A. Phillips, R. N. Uma, and J. Wein. Off-line admission control for general scheduling problems. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 879\u2013888. 2000.","DOI":"10.1002\/1099-1425(200011\/12)3:6<365::AID-JOS56>3.0.CO;2-P"},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"P. Raghavan and C. D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365\u2013374, 1987.","journal-title":"Combinatorica"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"A. Srinivasan. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pp. 416\u2013425. 1997.","DOI":"10.1109\/SFCS.1997.646130"},{"issue":"2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1137\/S0097539796314240","volume":"29","author":"A. Srinivasan","year":"1999","unstructured":"A. Srinivasan. Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput., 29(2):648\u2013670, 1999.","journal-title":"SIAM J. Comput."},{"key":"7_CR20","unstructured":"A. Srinivasan. New approaches to covering and packing problems. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 567\u2013576. 2001."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45753-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:38:48Z","timestamp":1737373128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45753-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441861","9783540457534"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45753-4_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}