{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:11:02Z","timestamp":1780384262957,"version":"3.54.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3546,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0022-0000(03)00066-7","type":"journal-article","created":{"date-parts":[[2003,6,9]],"date-time":"2003-06-09T21:53:18Z","timestamp":1055195598000},"page":"473-496","source":"Crossref","is-referenced-by-count":100,"title":["Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems"],"prefix":"10.1016","volume":"67","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruce","family":"Shepherd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00066-7_BIB1","unstructured":"Y. Aumann, Y. Rabani, Improved bounds for all optical routing, Proceedings of 6th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1995, pp. 567\u2013576."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0020-0190(00)00033-8","article-title":"Approximating low-congestion routing and column-restricted packing problems","volume":"74","author":"Baveja","year":"2000","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB3","unstructured":"A. Bley, On the complexity of vertex-disjoint length-restricted path problems, Technical Report SC-98-20, Konrad-Zue-Zentrum f\u00fcr Informationstechnik, Berlin, 1998."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. of Math. Statist."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB5","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"Dinitz","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB6","doi-asserted-by":"crossref","unstructured":"Y. Dinitz, N. Garg, M.X. Goemans, On the single source unsplittable flow problem, Proceedings of the 39th Symposium on the Foundations of Computer Science, Palo Alto, CA, 1998, pp. 290\u2013299.","DOI":"10.1109\/SFCS.1998.743461"},{"issue":"4","key":"10.1016\/S0022-0000(03)00066-7_BIB7","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0022-0000(03)00066-7_BIB8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","article-title":"The directed subgraph homeomorphism problem","volume":"10","author":"Fortune","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB9","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02523685","article-title":"Primal-dual approximation algorithms for integral flow and multicut in trees","volume":"18","author":"Garg","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03b5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Mathematica"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB13","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","article-title":"Multi-commodity network flows","volume":"11","author":"Hu","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","article-title":"Maximum bounded 3-dimensional matching is MAX SNP-complete","volume":"37","author":"Kann","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB15","doi-asserted-by":"crossref","unstructured":"J.M. Kleinberg, Single-source unsplittable flow, Proceedings of the 37th Symposium on the Foundations of Computer Science, Burlington, VT, 1996, pp. 68\u201377.","DOI":"10.1109\/SFCS.1996.548465"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB16","unstructured":"J.M. Kleinberg, Approximation algorithms for disjoint paths problems, Ph.D. Thesis, MIT, Cambridge, MA, May 1996."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB17","doi-asserted-by":"crossref","unstructured":"J.M. Kleinberg, Decision algorithms for unsplittable flow and the half-disjoint paths problem, Proceedings of STOC \u201998, Dallas, TX, pp. 530\u2013539.","DOI":"10.1145\/276698.276867"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1006\/jcss.1998.1579","article-title":"Approximations for the disjoint paths problem in high-diameter planar networks","volume":"57","author":"Kleinberg","year":"1998","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB19","doi-asserted-by":"crossref","unstructured":"J.M. Kleinberg, \u00c9. Tardos, Disjoint paths in densely embedded graphs, Proceedings of the 36th Symposium on the Foundations of Computer Science, Milwaukee, WI, 1995, pp. 52\u201361.","DOI":"10.1109\/SFCS.1995.492462"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB20","unstructured":"S.G. Kolliopoulos, Exact and approximation algorithms for network flow and disjoint-path problems, Ph.D. Thesis, Dartmouth College, Hanover, NH, August 1998."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB21","doi-asserted-by":"crossref","unstructured":"S.G. Kolliopoulos, C. Stein, Improved approximation algorithms for unsplittable flow problems, Proceedings of the 38th Symposium on the Foundations of Computer Science, Miami Beach, FL, 1997, pp. 426\u2013435.","DOI":"10.1109\/SFCS.1997.646131"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB22","doi-asserted-by":"crossref","unstructured":"S.G. Kolliopoulos, C. Stein, Approximating disjoint-path problems using greedy algorithms and Packing Integer Programs, Integer programming and Combinatorial Optimization, Houston, TX, 1998.","DOI":"10.1007\/3-540-69346-7_12"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB23","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, S.B. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, Proceedings of the 29th Symposium on the Foundations of Computer Science, White Plains, NY, 1988, pp. 422\u2013431.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1999.1661","article-title":"On the inapproximability of disjoint paths and minimum steiner forest with bandwidth constraints","volume":"60","author":"Ma","year":"2000","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0022-0000(03)00066-7_BIB25","article-title":"Algebraic Topology: An Introduction","volume":"Vol. 56","author":"Massey","year":"1967"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB26","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","article-title":"Randomized rounding","volume":"7","author":"Raghavan","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB27","series-title":"Paths, Flows and VLSI-Layout","article-title":"Outline of a disjoint paths algorithm","author":"Robertson","year":"1990"},{"key":"10.1016\/S0022-0000(03)00066-7_BIB28","doi-asserted-by":"crossref","unstructured":"A. Srinivasan, Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems, Proceedings of the 38th Symposium on the Foundations of Computer Science, Miami Beach, FL, 1997, pp. 416\u2013425.","DOI":"10.1109\/SFCS.1997.646130"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000667?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000667?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T20:34:50Z","timestamp":1734035690000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0022000003000667"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00066-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}