{"id":"https://openalex.org/W4281710856","doi":"https://doi.org/10.1145/3519935.3520026","title":"Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality","display_name":"Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281710856","doi":"https://doi.org/10.1145/3519935.3520026"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520026","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520026","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT 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/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]},{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["CH","US"],"is_corresponding":true,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Carnegie Mellon University, USA / ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA / ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I74973139","https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016682913","display_name":"Harald R\u00e4cke","orcid":"https://orcid.org/0000-0001-8797-717X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harald R\u00e4cke","raw_affiliation_strings":["TU Munich, Germany"],"affiliations":[{"raw_affiliation_string":"TU Munich, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080591933"],"corresponding_institution_ids":["https://openalex.org/I35440088","https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":2.7052,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.91240449,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1325","last_page":"1338"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.7069672346115112},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5370041728019714},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5120585560798645},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.511660099029541},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4558708369731903},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4482561945915222},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4453674554824829},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43935996294021606},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4378267824649811},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.41201460361480713},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2747476100921631}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7069672346115112},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5370041728019714},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5120585560798645},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.511660099029541},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4558708369731903},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4482561945915222},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4453674554824829},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43935996294021606},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4378267824649811},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.41201460361480713},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2747476100921631},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3520026","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520026","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT 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":16,"referenced_works":["https://openalex.org/W1945440063","https://openalex.org/W2005900781","https://openalex.org/W2030825457","https://openalex.org/W2053788000","https://openalex.org/W2053981136","https://openalex.org/W2084427019","https://openalex.org/W2100466311","https://openalex.org/W2163097371","https://openalex.org/W2169528477","https://openalex.org/W2172178473","https://openalex.org/W3020969699","https://openalex.org/W3127312219","https://openalex.org/W3172739028","https://openalex.org/W4205300528","https://openalex.org/W4252842032","https://openalex.org/W4254419859"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W3035942111","https://openalex.org/W2138640781","https://openalex.org/W1563839700","https://openalex.org/W2251995179","https://openalex.org/W2347665962","https://openalex.org/W2154440508","https://openalex.org/W2607223747","https://openalex.org/W2361465121"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,15,47,57],"fundamental":[4],"task":[5],"of":[6,17,40,45,49],"establishing":[7],"routing":[8,19,35],"paths":[9,36,51],"in":[10,23],"distributed":[11],"networks.":[12],"We":[13],"prove":[14],"existence":[16],"compact":[18],"tables":[20],"that":[21],"store":[22],"each":[24],"network-node":[25],"few":[26],"simple":[27],"forwarding":[28],"rules":[29],"tracing":[30],"out":[31],"hop-constrained":[32],"and":[33],"oblivious":[34],"for":[37],"any":[38,43],"pair":[39],"nodes.":[41],"For":[42],"collection":[44],"pairs":[46],"congestion":[48],"these":[50],"is":[52],"almost-optimal,":[53],"i.e.,":[54],"competitive":[55],"with":[56],"globally":[58],"optimal":[59],"solution":[60],"up":[61],"to":[62],"a":[63],"sub-polynomial":[64],"factor.":[65]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2}],"updated_date":"2026-03-18T06:27:02.140700","created_date":"2025-10-10T00:00:00"}