{"id":"https://openalex.org/W3200593310","doi":"https://doi.org/10.4086/toc.2021.v017a006","title":"","display_name":"","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3200593310","doi":"https://doi.org/10.4086/toc.2021.v017a006","mag":"3200593310"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2021.v017a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2021.v017a006","pdf_url":"http://www.theoryofcomputing.org/articles/v017a006/v017a006.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":"http://www.theoryofcomputing.org/articles/v017a006/v017a006.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056023203","display_name":"Julia Chuzhoy","orcid":"https://orcid.org/0000-0001-7839-751X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029611420","display_name":"David Hong Kyun Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Hong Kyun Kim","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056916494","display_name":"Rachit Nimavat","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rachit Nimavat","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056023203"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1515,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5333751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"17","issue":"1","first_page":"1","last_page":"57"},"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.9943000078201294,"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.9943000078201294,"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.9932000041007996,"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.9793999791145325,"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/dtime","display_name":"DTIME","score":0.8986543416976929},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8623690009117126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6231278777122498},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6131329536437988},{"id":"https://openalex.org/keywords/apx","display_name":"APX","score":0.6111485362052917},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.577085554599762},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5422376990318298},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5076814889907837},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4485623836517334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3992776572704315},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3736006021499634},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.22394073009490967},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.14139771461486816},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1021503210067749}],"concepts":[{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.8986543416976929},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8623690009117126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6231278777122498},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6131329536437988},{"id":"https://openalex.org/C130698151","wikidata":"https://www.wikidata.org/wiki/Q4653447","display_name":"APX","level":4,"score":0.6111485362052917},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.577085554599762},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5422376990318298},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5076814889907837},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4485623836517334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3992776572704315},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3736006021499634},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.22394073009490967},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.14139771461486816},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1021503210067749},{"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/C181199279","wikidata":"https://www.wikidata.org/wiki/Q8047","display_name":"Enzyme","level":2,"score":0.0},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"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/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C162008176","wikidata":"https://www.wikidata.org/wiki/Q419305","display_name":"Peroxidase","level":3,"score":0.0},{"id":"https://openalex.org/C46141821","wikidata":"https://www.wikidata.org/wiki/Q209402","display_name":"Nuclear magnetic resonance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2021.v017a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2021.v017a006","pdf_url":"http://www.theoryofcomputing.org/articles/v017a006/v017a006.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.2021.v017a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2021.v017a006","pdf_url":"http://www.theoryofcomputing.org/articles/v017a006/v017a006.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/G5195639160","display_name":null,"funder_award_id":"CCF-1616584","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8189995863","display_name":"AF: Small: Graph Routing, Vertex Sparsifiers, and Connections to Graph Theory","funder_award_id":"1616584","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8334011178","display_name":null,"funder_award_id":"CCF-1318242","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8558341523","display_name":"AF: Small: Algorithms for Graph Routing, Drawing and Partitioning","funder_award_id":"1318242","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3200593310.pdf","grobid_xml":"https://content.openalex.org/works/W3200593310.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1515157528","https://openalex.org/W1969534344","https://openalex.org/W1970259241","https://openalex.org/W1999867351","https://openalex.org/W2003160050","https://openalex.org/W2005079828","https://openalex.org/W2005509629","https://openalex.org/W2011334641","https://openalex.org/W2015236004","https://openalex.org/W2019041817","https://openalex.org/W2019062750","https://openalex.org/W2019404063","https://openalex.org/W2022191808","https://openalex.org/W2024972568","https://openalex.org/W2030365814","https://openalex.org/W2032312374","https://openalex.org/W2035272561","https://openalex.org/W2038643780","https://openalex.org/W2049411106","https://openalex.org/W2058091369","https://openalex.org/W2060632898","https://openalex.org/W2062948942","https://openalex.org/W2064656298","https://openalex.org/W2072802070","https://openalex.org/W2081008200","https://openalex.org/W2086423976","https://openalex.org/W2091602684","https://openalex.org/W2108736261","https://openalex.org/W2114218179","https://openalex.org/W2121839513","https://openalex.org/W2122997342","https://openalex.org/W2140262267","https://openalex.org/W2145818650","https://openalex.org/W2150148016","https://openalex.org/W2170344325","https://openalex.org/W2171868840","https://openalex.org/W2218607027","https://openalex.org/W2295563127","https://openalex.org/W2297903070","https://openalex.org/W2515641369","https://openalex.org/W2550041253","https://openalex.org/W2552383377","https://openalex.org/W2885925565","https://openalex.org/W2913492813","https://openalex.org/W2963896308","https://openalex.org/W2963966355","https://openalex.org/W3028209208","https://openalex.org/W3102777411","https://openalex.org/W4226347946","https://openalex.org/W4232231123"],"related_works":["https://openalex.org/W1968792424","https://openalex.org/W2388585099","https://openalex.org/W3142515058","https://openalex.org/W910870098","https://openalex.org/W2765725004","https://openalex.org/W1537426782","https://openalex.org/W2536885665","https://openalex.org/W2001352447","https://openalex.org/W3022252369","https://openalex.org/W2043936605"],"abstract_inverted_index":{"In":[0],"the":[1,54,98,125],"classical":[2],"Node-Disjoint":[3],"Paths":[4],"(NDP)":[5],"problem,":[6],"we":[7,64],"are":[8,77],"given":[9],"an":[10,89],"n-vertex":[11],"graph":[12,127],"G":[13],"=":[14,21],"(V,":[15],"E),":[16],"and":[17],"a":[18,62,68,104,129,132],"collection":[19],"M":[20],"{(s":[22],"1":[23,25],",t":[24,33],"),":[26],".":[27,28,29],",":[30],"(s":[31],"k":[32,34],")}":[35],"of":[36,38,53,111,131],"pairs":[37,56],"its":[39],"vertices,":[40],"called":[41],"source-destination,":[42],"or":[43],"demand":[44,55],"pairs.":[45],"The":[46,82],"goal":[47],"is":[48,103,128],"to":[49,60,66,141],"route":[50,61],"as":[51,57],"many":[52],"possible,":[58],"where":[59],"pair":[63],"need":[65],"select":[67],"path":[69],"connecting":[70],"it,":[71],"so":[72],"that":[73],"all":[74],"selected":[75],"paths":[76],"disjoint":[78],"in":[79],"their":[80],"vertices.":[81],"best":[83,99],"current":[84,100],"algorithm":[85],"for":[86],"NDP":[87],"achieves":[88],"O(":[90],"n)-approximation":[91],"[Kolliopoulos,":[92],"Stein,":[93],"Math.":[94],"Progr.":[95],"2004],":[96],"while":[97],"negative":[101],"result":[102,137],"factor":[105],"2":[106],"(":[107],"log":[108],"n)":[109,117],"-hardness":[110],"approximation":[112],"unless":[113],"NP":[114],"DTIME(n":[115],"O(log":[116],")":[118],"[Chuzhoy,":[119],"Kim,":[120],"Nimavat,":[121],"STOC'17],":[122],"even":[123],"if":[124],"underlying":[126],"subgraph":[130],"grid":[133,142],"graph;":[134],"unfortunately,":[135],"this":[136],"does":[138],"not":[139],"extend":[140],"graphs.":[143]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2021-09-27T00:00:00"}