{"id":"https://openalex.org/W2126492985","doi":"https://doi.org/10.1145/1250790.1250816","title":"Hardness of routing with congestion in directed graphs","display_name":"Hardness of routing with congestion in directed graphs","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W2126492985","doi":"https://doi.org/10.1145/1250790.1250816","mag":"2126492985"},"language":"en","primary_location":{"id":"doi:10.1145/1250790.1250816","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250816","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"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":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Institute of Advanced Study, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Institute of Advanced Study, Princeton, NJ","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["University of Washington, Seattle, WA","University Of Washington (Seattle, WA)"],"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"University Of Washington (Seattle, WA)","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080065269","display_name":"Kunal Talwar","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kunal Talwar","raw_affiliation_strings":["Microsoft Research SVC, Mountain View, CA","Microsoft Research, SVC, Mountain View, CA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research SVC, Mountain View, CA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, SVC, Mountain View, CA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5056023203"],"corresponding_institution_ids":["https://openalex.org/I40036882"],"apc_list":null,"apc_paid":null,"fwci":4.8564,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.95158638,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"165","last_page":"178"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9980000257492065,"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.9969000220298767,"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.7306969165802002},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6762899160385132},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6125178933143616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5522428154945374},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5137218236923218},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49149906635284424},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4890476167201996},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46793243288993835},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4660424292087555},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.44309747219085693},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4386478066444397},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4346047043800354},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.43260008096694946},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4226028323173523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23427420854568481}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7306969165802002},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6762899160385132},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6125178933143616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5522428154945374},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5137218236923218},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49149906635284424},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4890476167201996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46793243288993835},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4660424292087555},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.44309747219085693},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4386478066444397},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4346047043800354},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.43260008096694946},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4226028323173523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23427420854568481},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1250790.1250816","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250816","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.3443","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.3443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/venkat/pubs/papers/diredpwc-merge.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.119.1023","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.1023","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~kunal/dir-edp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1485936828","https://openalex.org/W1501644705","https://openalex.org/W1524585687","https://openalex.org/W1591562949","https://openalex.org/W1989234747","https://openalex.org/W1997988698","https://openalex.org/W1999032440","https://openalex.org/W1999867351","https://openalex.org/W2011764853","https://openalex.org/W2020087044","https://openalex.org/W2022191808","https://openalex.org/W2025470209","https://openalex.org/W2034269606","https://openalex.org/W2058821164","https://openalex.org/W2081254453","https://openalex.org/W2119862441","https://openalex.org/W2122997342","https://openalex.org/W2123416347","https://openalex.org/W2125725829","https://openalex.org/W2132991500","https://openalex.org/W2135424293","https://openalex.org/W2154276597","https://openalex.org/W2154571828","https://openalex.org/W4388717750","https://openalex.org/W6665106537"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2052169362","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2963158951","https://openalex.org/W2070751425"],"abstract_inverted_index":{"Given":[0],"as":[1],"input":[2],"a":[3,10,104,115],"directed":[4],"graph":[5],"on":[6,26],"n":[7],"vertices":[8],"and":[9],"set":[11],"ofsource-destination":[12],"pairs,":[13],"we":[14,50],"study":[15],"the":[16,53,70,77,100],"problem":[17],"of":[18,23,135],"routing":[19],"themaximum":[20],"possible":[21],"number":[22],"source-destination":[24],"pairs":[25,58],"paths,":[27,60],"suchthat":[28],"at":[29],"most":[30],"c(N)":[31,72,81],"paths":[32],"go":[33],"through":[34],"any":[35],"edge.":[36],"We":[37,119],"show":[38],"that":[39,56,126,128],"theproblem":[40],"is":[41,98,109],"hard":[42],"to":[43,52,142],"approximate":[44],"within":[45],"an":[46,132],"N\u03a9(1/c(N))":[47],"factoreven":[48],"when":[49],"compare":[51],"optimal":[54],"solution":[55],"routes":[57],"onedge-disjoint":[59],"assuming":[61],"NP":[62],"doesn't":[63],"have":[64],"NO(log":[65],"logN)-time":[66],"randomized":[67],"algorithms.":[68],"Here":[69],"congestion":[71],"can":[73],"beany":[74],"function":[75],"in":[76,99],"range":[78],"1":[79,141],"\u2264":[80,82],"\u03b1":[83,92],"log":[84,86,145],"N/log":[85],"N":[87],"for":[88,111,137],"some":[89],"absolute":[90],"constant":[91],">":[93],"0.":[94],"The":[95],"hardness":[96],"result":[97],"right":[101],"ballpark":[102],"since":[103],"factor":[105],"NO(1/c(N))":[106],"approximation":[107],"algorithm":[108],"known":[110],"this":[112],"problem,":[113],"viarounding":[114],"natural":[116],"multicommodity-flow":[117],"relaxation.":[118],"also":[120],"give":[121],"asimple":[122],"integrality":[123,133],"gap":[124,134],"construction":[125],"shows":[127],"themulticommodity-flow":[129],"relaxation":[130],"has":[131],"N\u03a9(1/c)":[136],"c":[138],"ranging":[139],"from":[140],"\u0398((log":[143],"n)/(log":[144],"n)).":[146]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}