{"id":"https://openalex.org/W2069159763","doi":"https://doi.org/10.1145/2213977.2214054","title":"Routing in undirected graphs with constant congestion","display_name":"Routing in undirected graphs with constant congestion","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2069159763","doi":"https://doi.org/10.1145/2213977.2214054","mag":"2069159763"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214054","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth 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/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, Chicago, IL, USA","Toyota Technological Institute at Chicago, Chicago, IL, USA ("],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I160992636"]},{"raw_affiliation_string":"Toyota Technological Institute at Chicago, Chicago, IL, USA (","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056023203"],"corresponding_institution_ids":["https://openalex.org/I160992636"],"apc_list":null,"apc_paid":null,"fwci":5.7281,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.96567919,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"855","last_page":"874"},"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.9994999766349792,"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.9991999864578247,"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.6601392030715942},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.653666615486145},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5817306041717529},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5736303329467773},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5240885615348816},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.49769046902656555},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47758960723876953},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.47418054938316345},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4590858519077301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45231834053993225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4482807517051697},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4361313581466675},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42883315682411194},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23597988486289978},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06465283036231995}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6601392030715942},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.653666615486145},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5817306041717529},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5736303329467773},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5240885615348816},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.49769046902656555},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47758960723876953},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.47418054938316345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4590858519077301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45231834053993225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4482807517051697},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4361313581466675},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42883315682411194},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23597988486289978},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06465283036231995},{"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/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"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/2213977.2214054","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":67,"referenced_works":["https://openalex.org/W748479430","https://openalex.org/W1559202792","https://openalex.org/W1563039933","https://openalex.org/W1567063736","https://openalex.org/W1591562949","https://openalex.org/W1593787329","https://openalex.org/W1786780942","https://openalex.org/W1964520854","https://openalex.org/W1966586808","https://openalex.org/W1969534344","https://openalex.org/W1974115975","https://openalex.org/W1978807904","https://openalex.org/W1979444789","https://openalex.org/W1984361668","https://openalex.org/W1989234747","https://openalex.org/W1989274820","https://openalex.org/W1999867351","https://openalex.org/W2001532889","https://openalex.org/W2003160050","https://openalex.org/W2005079828","https://openalex.org/W2005509629","https://openalex.org/W2011334641","https://openalex.org/W2011764853","https://openalex.org/W2012776084","https://openalex.org/W2012969943","https://openalex.org/W2019041817","https://openalex.org/W2019062750","https://openalex.org/W2022191808","https://openalex.org/W2023176678","https://openalex.org/W2024972568","https://openalex.org/W2032312374","https://openalex.org/W2033480692","https://openalex.org/W2034269606","https://openalex.org/W2035099047","https://openalex.org/W2035272561","https://openalex.org/W2036669621","https://openalex.org/W2040785801","https://openalex.org/W2044343300","https://openalex.org/W2066398433","https://openalex.org/W2078013954","https://openalex.org/W2080283527","https://openalex.org/W2081008200","https://openalex.org/W2088844265","https://openalex.org/W2104935810","https://openalex.org/W2107881198","https://openalex.org/W2108736261","https://openalex.org/W2109693504","https://openalex.org/W2111221897","https://openalex.org/W2115448953","https://openalex.org/W2119862441","https://openalex.org/W2122997342","https://openalex.org/W2126492985","https://openalex.org/W2135424293","https://openalex.org/W2140262267","https://openalex.org/W2141793995","https://openalex.org/W2145701440","https://openalex.org/W2145818650","https://openalex.org/W2150148016","https://openalex.org/W2150187954","https://openalex.org/W2150516767","https://openalex.org/W2152982698","https://openalex.org/W2157421865","https://openalex.org/W2167374893","https://openalex.org/W2170344325","https://openalex.org/W2171868840","https://openalex.org/W2401610261","https://openalex.org/W6633666975"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W3129272755","https://openalex.org/W2138685729","https://openalex.org/W26693340","https://openalex.org/W1963777171","https://openalex.org/W2072510267"],"abstract_inverted_index":{"Given":[0],"an":[1,13,55],"undirected":[2],"graph":[3],"G=(V,E),":[4],"a":[5,114],"collection":[6],"(s1,t1),...,(sk,tk)":[7],"of":[8,32,77,126],"k":[9],"demand":[10,34,64],"pairs,":[11],"and":[12,102],"integer":[14],"c,":[15,116],"the":[16,19,33,40,74,104,107,117,124],"goal":[17],"in":[18],"Edge":[20],"Disjoint":[21],"Paths":[22],"with":[23,66],"Congestion":[24],"problem":[25],"is":[26,73,111],"to":[27],"connect":[28],"maximum":[29,41,75,108],"possible":[30],"number":[31,76],"pairs":[35,65,78,96],"by":[36,113],"paths,":[37],"so":[38],"that":[39,59,79,91],"load":[42],"on":[43,84],"any":[44],"edge":[45,47],"(called":[46],"congestion)":[48],"does":[49],"not":[50],"exceed":[51],"c.":[52],"We":[53],"show":[54],"efficient":[56],"randomized":[57],"algorithm":[58,90],"routes":[60],"\u03a9(OPT/poly":[61,93],"log":[62,94,100],"k)":[63],"congestion":[67,98,110],"at":[68],"most":[69],"14,":[70],"where":[71,106],"OPT":[72],"can":[80],"be":[81],"simultaneously":[82],"routed":[83,92],"edge-disjoint":[85],"paths.":[86],"The":[87],"best":[88,118],"previous":[89,119],"n)":[95],"required":[97],"poly(log":[99],"n),":[101],"for":[103],"setting":[105],"allowed":[109],"bounded":[112],"constant":[115],"algorithms":[120],"could":[121],"only":[122],"guarantee":[123],"routing":[125],"OPT/nO(1/c)":[127],"pairs.":[128]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}