{"id":"https://openalex.org/W2550041253","doi":"https://doi.org/10.1145/3055399.3055411","title":"New hardness results for routing on disjoint paths","display_name":"New hardness results for routing on disjoint paths","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2550041253","doi":"https://doi.org/10.1145/3055399.3055411","mag":"2550041253"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055411","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055411","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055411&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3055411&type=pdf","any_repository_has_fulltext":null},"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":1.6589,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.84787699,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"86","last_page":"99"},"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/T10374","display_name":"Advanced Graph Theory Research","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.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.795660138130188},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7070834040641785},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7060999870300293},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5769824385643005},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4998903274536133},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4762837290763855},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46750032901763916},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45753246545791626},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44838616251945496},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43239012360572815},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4307973384857178},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4262698292732239},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.41519638895988464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2689095735549927}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.795660138130188},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7070834040641785},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7060999870300293},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5769824385643005},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4998903274536133},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4762837290763855},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46750032901763916},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45753246545791626},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44838616251945496},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43239012360572815},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4307973384857178},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4262698292732239},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.41519638895988464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2689095735549927},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3055399.3055411","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055411","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055411&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3055399.3055411","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055411","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055411&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1137014957","display_name":null,"funder_award_id":"CCF-1318242, CCF-1616584","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/W2550041253.pdf","grobid_xml":"https://content.openalex.org/works/W2550041253.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W748479430","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/W2019041817","https://openalex.org/W2019578639","https://openalex.org/W2022191808","https://openalex.org/W2035099047","https://openalex.org/W2035272561","https://openalex.org/W2060632898","https://openalex.org/W2062948942","https://openalex.org/W2064656298","https://openalex.org/W2081008200","https://openalex.org/W2121839513","https://openalex.org/W2122997342","https://openalex.org/W2140262267","https://openalex.org/W2145818650","https://openalex.org/W2148352980","https://openalex.org/W2160167461","https://openalex.org/W2171868840","https://openalex.org/W2295563127","https://openalex.org/W2297903070","https://openalex.org/W2401610261","https://openalex.org/W2515641369","https://openalex.org/W4237850333","https://openalex.org/W4255529553"],"related_works":["https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W2131810278","https://openalex.org/W1594413663","https://openalex.org/W2307719096","https://openalex.org/W2906860838","https://openalex.org/W1561811279","https://openalex.org/W189401716","https://openalex.org/W2019216770","https://openalex.org/W2574250816"],"abstract_inverted_index":{"In":[0],"the":[1,7,35,40,51,66,90,97,103,118,140],"classical":[2],"Node-Disjoint":[3],"Paths":[4],"(NDP)":[5],"problem,":[6],"input":[8,98],"consists":[9],"of":[10,20,22,39,74,89,123,139],"an":[11,72,108,124],"undirected":[12],"n-vertex":[13],"graph":[14,99],"G,":[15],"and":[16,110],"a":[17,56,101,114],"collection":[18],"M={(s1,t1),\u2026,(sk,tk)}":[19],"pairs":[21,42],"its":[23],"vertices,":[24],"called":[25],"source-destination,":[26],"or":[27],"demand,":[28],"pairs.":[29],"The":[30,46,129],"goal":[31],"is":[32,53,63,71,100,113,127,142],"to":[33],"route":[34],"largest":[36],"possible":[37],"number":[38],"demand":[41],"via":[43],"node-disjoint":[44],"paths.":[45],"best":[47,67,104,119,130],"current":[48,68,105,120],"approximation":[49,61,75,121],"for":[50,76,135],"problem":[52,91,141],"achieved":[54],"by":[55],"simple":[57,86],"greedy":[58],"algorithm,":[59],"whose":[60],"factor":[62],"O(\u221an),":[64],"while":[65],"negative":[69],"result":[70],"\u03a9(log1/2-\u03b4n)-hardness":[73],"any":[77],"constant":[78],"\u03b4,":[79],"under":[80],"standard":[81],"complexity":[82],"assumptions.":[83],"Even":[84],"seemingly":[85],"special":[87],"cases":[88],"are":[92],"still":[93],"poorly":[94],"understood:":[95],"when":[96,111],"grid,":[102],"algorithm":[106,126],"achieves":[107],"\u00d5(n1/4)-approximation,":[109],"it":[112],"general":[115],"planar":[116],"graph,":[117],"ratio":[122],"efficient":[125],"\u00d5(n9/19).":[128],"currently":[131],"known":[132],"lower":[133],"bound":[134],"both":[136],"these":[137],"versions":[138],"APX-hardness.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}