{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:13:01Z","timestamp":1787501581836,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642036842","type":"print"},{"value":"9783642036859","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03685-9_4","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T22:39:51Z","timestamp":1250807991000},"page":"42-55","source":"Crossref","is-referenced-by-count":33,"title":["Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alina","family":"Ene","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nitish","family":"Korula","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Andrews, M., Chuzhoy, J., Khanna, S., Zhang, L.: Hardness of the undirected edge-disjoint paths problem with congestion. In: Proc. of IEEE FOCS, pp. 226\u2013241 (2005)","DOI":"10.1109\/SFCS.2005.41"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00453-005-1172-z","volume":"441","author":"Y. Azar","year":"2006","unstructured":"Azar, Y., Regev, O.: Combinatorial algorithms for the unsplittable flow problem. Algorithmica\u00a0441(1), 49\u201366 (2006)","journal-title":"Algorithmica"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Friggstad, Z., Khandekar, R., Salavatipour, M.R.: A logarithmic approximation for unsplittable flow on line graphs. In: Proc. of ACM-SIAM SODA, pp. 702\u2013709 (2009)","DOI":"10.1137\/1.9781611973068.77"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A Quasi-PTAS for unsplittable flow on line graphs. In: Proc. of ACM STOC, pp. 721\u2013729 (2006)","DOI":"10.1145\/1132516.1132617"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. JACM\u00a048(5), 1069\u20131090 (2001)","journal-title":"JACM"},{"issue":"2","key":"4_CR6","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the Throughput of Multiple Machines in Real-Time Scheduling. SICOMP\u00a031(2), 331\u2013352 (2001)","journal-title":"SICOMP"},{"issue":"2","key":"4_CR7","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. Math. Oper. Res.\u00a025(2), 255\u2013280 (2000)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.orl.2007.09.003","volume":"36","author":"D. Bienstock","year":"2008","unstructured":"Bienstock, D.: Approximate formulations for 0-1 knapsack sets. Oper. Res. Lett.\u00a036(3), 317\u2013320 (2008)","journal-title":"Oper. Res. Lett."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Chakrabarti, A., Karloff, H., Rabani, Y.: Improved approximation algorithms for resource allocation. In: Proc. of IPCO, pp. 439\u2013456 (2001)","DOI":"10.1007\/3-540-47867-1_28"},{"key":"4_CR10","unstructured":"Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proc. of ACM-SIAM SODA, pp. 106\u2013115 (2000)"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/rsa.10033","volume":"20","author":"R. Carr","year":"2002","unstructured":"Carr, R., Vempala, S.: Randomized meta-rounding. Random Structures and Algorithms\u00a020(3), 343\u2013352 (2002)","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00453-006-1210-5","volume":"47","author":"A. Chakrabarti","year":"2007","unstructured":"Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica\u00a047(1), 53\u201378 (2007)","journal-title":"Algorithmica"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.4086\/toc.2006.v002a007","volume":"2","author":"C. Chekuri","year":"2006","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: An $O(\\sqrt{n})$ Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory of Computing\u00a02, 137\u2013146 (2006)","journal-title":"Theory of Computing"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: Edge-Disjoint Paths in Planar Graphs with Constant Congestion. In: Proc. of ACM STOC, pp. 757\u2013766 (2006)","DOI":"10.1145\/1132516.1132621"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity Demand Flow in a Tree and Packing Integer Programs. ACM Trans. on Algorithms\u00a03(3) (2007)","DOI":"10.1145\/1273340.1273343"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K.: Hardness of Routing with Congestion in Directed Graphs. In: Proc. of ACM STOC, pp. 165\u2013178 (2007)","DOI":"10.1145\/1250790.1250816"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica\u00a018(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0022-0000(03)00066-7","volume":"67","author":"V. Guruswami","year":"2003","unstructured":"Guruswami, V., Khanna, S., Shepherd, B., Rajaraman, R., Yannakakis, M.: Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. J. of Computer and System Sciences\u00a067(3), 473\u2013496 (2003)","journal-title":"J. of Computer and System Sciences"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is Hard to Approximate within n 1\u03b5 . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"4_CR20","unstructured":"Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT EECS (1996)"},{"key":"4_CR21","volume-title":"Handbook of Approximation Algorithms and Metaheuristics","author":"S.G. Kolliopoulos","year":"2007","unstructured":"Kolliopoulos, S.G.: Edge-disjoint Paths and Unsplittable Flow. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10107-002-0370-6","volume":"99","author":"S.G. Kolliopoulos","year":"2004","unstructured":"Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using greedy algorithms and Packing Integer Programs. Math. Prog. A\u00a0(99), 63\u201387 (2004)","journal-title":"Math. Prog. A"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0020-0190(03)00351-X","volume":"88","author":"P. Kolman","year":"2003","unstructured":"Kolman, P.: A Note on the Greedy Algorithm for the Unsplittable Flow Problem. Information Processing Letters\u00a088(3), 101\u2013105 (2003)","journal-title":"Information Processing Letters"},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jalgor.2004.07.006","volume":"61","author":"P. Kolman","year":"2006","unstructured":"Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. J. of Algorithms\u00a061(1), 20\u201344 (2006)","journal-title":"J. of Algorithms"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Pritchard, D.: Approximability of Sparse Integer Programs. In: Proc. of ESA (to appear, 2009); arXiv.org preprint, arXiv:0904.0859v1, http:\/\/arxiv.org\/abs\/0904.0859","DOI":"10.1007\/978-3-642-04128-0_8"},{"issue":"2","key":"4_CR26","first-page":"130","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. JCSS\u00a037(2), 130\u2013143 (1988)","journal-title":"JCSS"},{"key":"4_CR27","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"issue":"3","key":"4_CR28","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1287\/moor.1070.0254","volume":"32","author":"B. Shepherd","year":"2007","unstructured":"Shepherd, B., Vetta, A.: The Demand Matching Problem. Math. of Operations Research\u00a032(3), 563\u2013578 (2007)","journal-title":"Math. of Operations Research"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Sherali, H., Adams, W.P.: A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-Integer Zero-One Programming Problems. Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science\u00a052 (1994)","DOI":"10.1016\/0166-218X(92)00190-W"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In: Proc. of IEEE FOCS, pp. 416\u2013425 (1997)","DOI":"10.1109\/SFCS.1997.646130"},{"key":"4_CR31","unstructured":"Srinivasan, A.: New Approaches to Covering and Packing Problems. In: Proc. of ACM-SIAM SODA, pp. 567\u2013576 (2001)"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-005-0663-7","volume":"105","author":"M. Vyve Van","year":"2006","unstructured":"Van Vyve, M., Wolsey, L.A.: Approximate Extended Formulations. Math. Prog.\u00a0105, 501\u2013522 (2006)","journal-title":"Math. Prog."},{"key":"4_CR33","unstructured":"Varadarajan, K., Venkataraman, G.: Graph Decomposition and a Greedy Algorithm for Edge-disjoint Paths. In: Proc. of ACM-SIAM SODA, pp. 379\u2013380 (2004)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03685-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T08:01:26Z","timestamp":1685088086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03685-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036842","9783642036859"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03685-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}