{"id":"https://openalex.org/W2140262267","doi":"https://doi.org/10.4086/toc.2006.v002a007","title":"","display_name":"","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2140262267","doi":"https://doi.org/10.4086/toc.2006.v002a007","mag":"2140262267"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2006.v002a007","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2006.v002a007","pdf_url":"https://theoryofcomputing.org/articles/v002a007/v002a007.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v002a007/v002a007.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044801840","display_name":"F. Bruce Shepherd","orcid":"https://orcid.org/0000-0003-1972-1396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Bruce Shepherd","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.7625,"has_fulltext":true,"cited_by_count":93,"citation_normalized_percentile":{"value":0.98319699,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"2","issue":"1","first_page":"137","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8693979382514954},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7514553070068359},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7114837169647217},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5858466625213623},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5687304735183716},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5645838379859924},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5547547936439514},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5221167802810669},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4734843969345093},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42361634969711304},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4223538637161255},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3746604323387146},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07639563083648682}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8693979382514954},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7514553070068359},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7114837169647217},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5858466625213623},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5687304735183716},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5645838379859924},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5547547936439514},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5221167802810669},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4734843969345093},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42361634969711304},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4223538637161255},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3746604323387146},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07639563083648682},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2006.v002a007","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2006.v002a007","pdf_url":"https://theoryofcomputing.org/articles/v002a007/v002a007.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2006.v002a007","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2006.v002a007","pdf_url":"https://theoryofcomputing.org/articles/v002a007/v002a007.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3631422143","display_name":null,"funder_award_id":"CCR-0093117","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6507447573","display_name":null,"funder_award_id":"several","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2140262267.pdf","grobid_xml":"https://content.openalex.org/works/W2140262267.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1589172288","https://openalex.org/W1591562949","https://openalex.org/W1966838648","https://openalex.org/W1974115975","https://openalex.org/W1996073274","https://openalex.org/W2001532889","https://openalex.org/W2005509629","https://openalex.org/W2011764853","https://openalex.org/W2019062750","https://openalex.org/W2034269606","https://openalex.org/W2058821164","https://openalex.org/W2074762809","https://openalex.org/W2080283527","https://openalex.org/W2119862441","https://openalex.org/W2154571828","https://openalex.org/W4301514928"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W4214487273","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4322810890","https://openalex.org/W2031552172"],"abstract_inverted_index":{"We":[0,39],"consider":[1],"the":[2,6,26,32,37,44,48,52,89,113,118,124,137,143,149],"maximization":[3],"version":[4],"of":[5,34,51,70,115],"edge-disjoint":[7],"path":[8],"problem":[9,140],"(EDP).":[10],"In":[11],"undirected":[12,78,98],"graphs":[13,99],"and":[14,79,100],"directed":[15,80,107],"acyclic":[16,81,108],"graphs,":[17],"we":[18],"obtain":[19],"an":[20],"O(":[21],"n)":[22,72],"upper":[23,45,60,86],"bound":[24,46,61,69,133],"on":[25,47,56,88],"approximation":[27,127],"ratio":[28],"where":[29],"n":[30,102],"is":[31,74,112,146],"number":[33,114],"nodes":[35],"in":[36,117],"graph.":[38,119],"show":[40],"this":[41],"by":[42],"establishing":[43],"integrality":[49,90],"gap":[50],"natural":[53],"relaxation":[54],"based":[55],"multicommodity":[57],"flows.":[58],"Our":[59,132],"matches":[62],"within":[63],"a":[64,67],"constant":[65],"factor":[66],"lower":[68],"(":[71],"that":[73],"known":[75,126],"for":[76,97,106,129],"both":[77],"graphs.":[82],"The":[83],"best":[84,125],"previous":[85],"bounds":[87,121],"gaps":[91],"were":[92],"O(min{n":[93],"2/3":[94],",":[95],"m})":[96,105],"O(min{":[101],"log":[103],"n,":[104],"graphs;":[109],"here":[110],"m":[111],"edges":[116],"These":[120],"are":[122],"also":[123,134],"ratios":[128],"these":[130],"problems.":[131],"extends":[135],"to":[136],"unsplittable":[138],"flow":[139],"(UFP)":[141],"when":[142],"maximum":[144],"demand":[145],"at":[147],"most":[148],"minimum":[150],"capacity.":[151]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}