{"id":"https://openalex.org/W2767782184","doi":"https://doi.org/10.1145/3188745.3188772","title":"Almost polynomial hardness of node-disjoint paths in grids","display_name":"Almost polynomial hardness of node-disjoint paths in grids","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2767782184","doi":"https://doi.org/10.1145/3188745.3188772","mag":"2767782184"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188772","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188772","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188772","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188772","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056023203","display_name":"Julia Chuzhoy","orcid":"https://orcid.org/0000-0001-7839-751X"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Toyota Technological Institute at Chicago, USA"],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, USA","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027622718","display_name":"David H. K. Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David H. K. Kim","raw_affiliation_strings":["University of Chicago, USA"],"affiliations":[{"raw_affiliation_string":"University of Chicago, USA","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056916494","display_name":"Rachit Nimavat","orcid":null},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rachit Nimavat","raw_affiliation_strings":["Toyota Technological Institute at Chicago, USA"],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, USA","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056023203"],"corresponding_institution_ids":["https://openalex.org/I160992636"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03061377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1220","last_page":"1233"},"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.9998999834060669,"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.9998999834060669,"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.9991999864578247,"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.9991000294685364,"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.7934436202049255},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.728784441947937},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.7083664536476135},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6447741985321045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6154068112373352},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5730032324790955},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5592113137245178},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5444025993347168},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4565032422542572},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4295906126499176},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4212530255317688},{"id":"https://openalex.org/keywords/apx","display_name":"APX","score":0.4116734266281128},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.376034677028656},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.15820178389549255},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1386105716228485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1003829836845398},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.06303942203521729}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7934436202049255},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.728784441947937},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.7083664536476135},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6447741985321045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6154068112373352},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5730032324790955},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5592113137245178},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5444025993347168},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4565032422542572},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4295906126499176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4212530255317688},{"id":"https://openalex.org/C130698151","wikidata":"https://www.wikidata.org/wiki/Q4653447","display_name":"APX","level":4,"score":0.4116734266281128},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.376034677028656},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.15820178389549255},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1386105716228485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1003829836845398},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.06303942203521729},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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},{"id":"https://openalex.org/C181199279","wikidata":"https://www.wikidata.org/wiki/Q8047","display_name":"Enzyme","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3188745.3188772","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188772","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188772","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1711.01980","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.01980","pdf_url":"https://arxiv.org/pdf/1711.01980","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:2767782184","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1711.01980.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1711.01980","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1711.01980","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3188745.3188772","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188772","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188772","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G186268257","display_name":null,"funder_award_id":"CCF-1318242, CCF-1318242","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/W2767782184.pdf","grobid_xml":"https://content.openalex.org/works/W2767782184.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1515157528","https://openalex.org/W1571257748","https://openalex.org/W1970259241","https://openalex.org/W1989234747","https://openalex.org/W1999867351","https://openalex.org/W2003160050","https://openalex.org/W2005079828","https://openalex.org/W2005509629","https://openalex.org/W2011334641","https://openalex.org/W2015232621","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/W2035099047","https://openalex.org/W2035272561","https://openalex.org/W2046175559","https://openalex.org/W2049411106","https://openalex.org/W2060632898","https://openalex.org/W2062948942","https://openalex.org/W2064656298","https://openalex.org/W2072802070","https://openalex.org/W2081008200","https://openalex.org/W2102373437","https://openalex.org/W2108684595","https://openalex.org/W2108736261","https://openalex.org/W2114218179","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/W2295563127","https://openalex.org/W2297903070","https://openalex.org/W2515641369","https://openalex.org/W2550041253","https://openalex.org/W2552383377","https://openalex.org/W2913492813","https://openalex.org/W2949666389","https://openalex.org/W2964080336"],"related_works":["https://openalex.org/W2951205595","https://openalex.org/W2295563127","https://openalex.org/W2293160748","https://openalex.org/W2774298280","https://openalex.org/W2154571828","https://openalex.org/W2107396513","https://openalex.org/W3034527053","https://openalex.org/W1509794588","https://openalex.org/W1483343493","https://openalex.org/W2952763838","https://openalex.org/W3018226465","https://openalex.org/W2963883886","https://openalex.org/W2021441806","https://openalex.org/W2980163628","https://openalex.org/W2212162741","https://openalex.org/W2402972486","https://openalex.org/W2554706764","https://openalex.org/W2965947731","https://openalex.org/W2023660553","https://openalex.org/W2399828101"],"abstract_inverted_index":{"In":[0,95],"the":[1,36,76,99,115,131,134],"classical":[2],"Node-Disjoint":[3],"Paths":[4],"(NDP)":[5],"problem,":[6],"we":[7,46],"are":[8,59],"given":[9],"an":[10,71,103],"n-vertex":[11],"graph":[12,117],"G=(V,E),":[13],"and":[14,125],"a":[15,44,50,81,96,119,122],"collection":[16],"M={(s1,t1),\u2026,(sk,tk)}":[17],"of":[18,20,35,84,106,121,133],"pairs":[19,38],"its":[21],"vertices,":[22],"called":[23],"source-destination,":[24],"or":[25],"demand":[26,37],"pairs.":[27],"The":[28,64],"goal":[29],"is":[30,118],"to":[31,42,48,142],"route":[32,43],"as":[33,39],"many":[34],"possible,":[40],"where":[41],"pair":[45],"need":[47],"select":[49],"path":[51],"connecting":[52],"it,":[53],"so":[54],"that":[55],"all":[56,126],"selected":[57],"paths":[58],"disjoint":[60],"in":[61],"their":[62],"vertices.":[63],"best":[65,77],"current":[66],"algorithm":[67],"for":[68,86,108],"NDP":[69],"achieves":[70],"O(\u221an)-approximation,":[72],"while,":[73],"until":[74],"recently,":[75],"negative":[78],"result":[79,138],"was":[80],"factor":[82],"\u03a9(log1/2\u2212\u0454n)-hardness":[83],"approximation,":[85],"any":[87],"constant":[88],"\u0454,":[89],"unless":[90,110],"NP":[91],"\u2286":[92],"ZPTIME(npoly":[93],"logn).":[94],"recent":[97],"work,":[98],"authors":[100],"have":[101],"shown":[102],"improved":[104],"2\u03a9(\u221alogn)-hardness":[105],"approximation":[107],"NDP,":[109],"NP\u2286":[111],"DTIME(nO(logn)),":[112],"even":[113],"if":[114],"underlying":[116],"subgraph":[120],"grid":[123,143],"graph,":[124],"source":[127],"vertices":[128],"lie":[129],"on":[130],"boundary":[132],"grid.":[135],"Unfortunately,":[136],"this":[137],"does":[139],"not":[140],"extend":[141],"graphs.":[144]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}