{"id":"https://openalex.org/W4399522705","doi":"https://doi.org/10.1145/3618260.3649627","title":"Lenzen\u2019s Distributed Routing Generalized: A Full Characterization of Constant-Time Routability","display_name":"Lenzen\u2019s Distributed Routing Generalized: A Full Characterization of Constant-Time Routability","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399522705","doi":"https://doi.org/10.1145/3618260.3649627"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649627","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618260.3649627","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649627","source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649627","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063743357","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0003-4213-9898"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0003-4213-9898","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078361948","display_name":"Brandon Wang","orcid":"https://orcid.org/0000-0002-3625-9896"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brandon Wang","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-3625-9896","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063743357"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1019419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"1877","last_page":"1888"},"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.9997000098228455,"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.9997000098228455,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9986000061035156,"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/constant","display_name":"Constant (computer programming)","score":0.6864215731620789},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6539285182952881},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5222271680831909},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5106967091560364},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4864963889122009},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4860565960407257},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4777737855911255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4732128977775574},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.45437854528427124},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4465731978416443},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4346049427986145},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.416551411151886},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.12964412569999695},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09286418557167053}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6864215731620789},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6539285182952881},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5222271680831909},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5106967091560364},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4864963889122009},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4860565960407257},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4777737855911255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4732128977775574},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.45437854528427124},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4465731978416443},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4346049427986145},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.416551411151886},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.12964412569999695},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09286418557167053},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3618260.3649627","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618260.3649627","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649627","source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/155710","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/155710","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/155710/1/3618260.3649627.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Association for Computing Machinery","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649627","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618260.3649627","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649627","source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399522705.pdf","grobid_xml":"https://content.openalex.org/works/W4399522705.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W1816797629","https://openalex.org/W1980744864","https://openalex.org/W1985361054","https://openalex.org/W1992996565","https://openalex.org/W2005900781","https://openalex.org/W2064779029","https://openalex.org/W2077371116","https://openalex.org/W2084427019","https://openalex.org/W2107008873","https://openalex.org/W2139535340","https://openalex.org/W2145492278","https://openalex.org/W2150148016","https://openalex.org/W2488670996","https://openalex.org/W2511108295","https://openalex.org/W2737872496","https://openalex.org/W2788015272","https://openalex.org/W2810492404","https://openalex.org/W2898867280","https://openalex.org/W2953390354","https://openalex.org/W2962677563","https://openalex.org/W2963005538","https://openalex.org/W2963275645","https://openalex.org/W2963650008","https://openalex.org/W2963747089","https://openalex.org/W2964107726","https://openalex.org/W2997284836","https://openalex.org/W3009187765","https://openalex.org/W3022033828","https://openalex.org/W3028705187","https://openalex.org/W3127810600","https://openalex.org/W3170394705","https://openalex.org/W3184953392","https://openalex.org/W3209631018","https://openalex.org/W4205300528","https://openalex.org/W4205463258","https://openalex.org/W4286504510","https://openalex.org/W4380880046","https://openalex.org/W6947900973"],"related_works":["https://openalex.org/W3161249280","https://openalex.org/W2267059662","https://openalex.org/W2364268683","https://openalex.org/W4388411807","https://openalex.org/W1519906715","https://openalex.org/W2478803962","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3211941742","https://openalex.org/W2035944803"],"abstract_inverted_index":{"A":[0],"celebrated":[1],"and":[2,8,70,74,292],"widely":[3],"used":[4],"result":[5,65,248],"of":[6,31,54,63,101,121,140,202,222,256,262,305,321],"Lenzen":[7],"Wattenhofer":[9],"[STOC\u201911,":[10],"PODC\u201913]":[11],"shows":[12],"a":[13,38,51,72,102,132,162,165,171,203,231,238,295,303,316,319],"constant-round":[14,39,103,204,239],"(deterministic)":[15,232],"distributed":[16,41,233,263,266,296],"routing":[17,104,205,240,297],"algorithm":[18,42,234,267],"for":[19,77,98,105,137,174,195,268,299],"the":[20,27,57,78,99,119,151,189,200,210,218,254,257,269,322],"complete-graph":[21,58],"network:":[22],"if":[23],"each":[24],"node":[25],"is":[26,37,110,182,213,230,315],"source":[28],"or":[29,170],"destination":[30],"at":[32,155],"most":[33],"\u0398(n)":[34],"packets,":[35],"there":[36,229],"deterministic":[40],"that":[43,81,96,112,125,178,228,235],"routes":[44],"all":[45,106],"packets":[46],"to":[47,66,251],"their":[48],"destinations":[49],"in":[50,88,124,206,241,244,276,288],"constant":[52,89,242],"number":[53,120],"rounds,":[55],"on":[56,148],"network.":[59],"We":[60,159,176],"study":[61],"generalizations":[62],"this":[64,161,179,223],"arbitrary":[67],"network":[68,79,211],"graphs":[69,208],"show":[71,177,199,227],"necessary":[73,111,180],"sufficient":[75],"condition":[76,181],"so":[80],"it":[82,109,314],"can":[83,93,273],"route":[84],"any":[85,113,138,277,282,300],"such":[86,107,237],"demand":[87],"rounds":[90,243],"distributedly.":[91],"One":[92],"easily":[94],"see":[95],"just":[97],"existence":[100,201],"demands,":[108],"cut\u2019s":[114],"size,":[115],"when":[116],"normalized":[117,168,308],"by":[118,131,187],"possible":[122],"edges":[123],"cut,":[126,169],"should":[127,153],"be":[128,274],"lower":[129,324],"bounded":[130],"positive":[133,166,172,196,207,278],"constant.":[134],"That":[135],"is,":[136],"partition":[139],"nodes":[141,147],"with":[142,164],"exactly":[143],"k\u2208":[144],"[1,":[145],"n/2]":[146],"one":[149],"side,":[150],"cut":[152,309],"have":[154],"least":[156],"\u0398(kn)":[157],"edges.":[158],"call":[160],"graph":[163,173,212,279],"minimum":[167,307],"short.":[175],"also":[183,226],"sufficient.":[184],"In":[185],"particular,":[186],"tightening":[188],"Leighton-Rao":[190],"multicommodity":[191],"max-flow":[192],"min-cut":[193],"theorem":[194],"graphs,":[197],"we":[198,225],"(assuming":[209],"known":[214],"globally).":[215],"Then,":[216],"as":[217,302],"main":[219],"technical":[220],"contribution":[221],"paper,":[224],"computes":[236],"these":[245],"graphs.":[246],"This":[247],"allows":[249],"us":[250],"vastly":[252],"relax":[253],"conditions":[255],"well-studied":[258],"congested":[259,270],"clique":[260,271],"model":[261,272],"computing:":[264],"Any":[265],"run":[275],"network,":[280,301],"without":[281,312],"asymptotic":[283],"slow-down.":[284],"Our":[285],"results":[286],"are":[287],"fact":[289],"more":[290],"general":[291],"they":[293],"give":[294],"bound":[298],"function":[304],"its":[306],"size":[310],"(and":[311],"assuming":[313],"constant),":[317],"within":[318],"polynomial":[320],"relevant":[323],"bound.":[325]},"counts_by_year":[],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}