{"id":"https://openalex.org/W3048053168","doi":"https://doi.org/10.1145/3465084.3467935","title":"Low-Congestion Shortcuts for Graphs Excluding Dense Minors","display_name":"Low-Congestion Shortcuts for Graphs Excluding Dense Minors","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3048053168","doi":"https://doi.org/10.1145/3465084.3467935","mag":"3048053168"},"language":"en","primary_location":{"id":"doi:10.1145/3465084.3467935","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2008.03091","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland","ETH Z\u00fcrich"],"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"ETH Z\u00fcrich","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"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":["US"],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Carnegie Mellon University & ETH Z\u00fcrich, Pittsburgh, PA, USA","Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University & ETH Z\u00fcrich, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.6027,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70173597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"213","last_page":"221"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.994700014591217,"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/T12288","display_name":"Optimization and Search Problems","score":0.9930999875068665,"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/combinatorics","display_name":"Combinatorics","score":0.7676749229431152},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.603290855884552},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5667575001716614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5505309104919434},{"id":"https://openalex.org/keywords/robertson\u2013seymour-theorem","display_name":"Robertson\u2013Seymour theorem","score":0.5177449584007263},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4981069564819336},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49271324276924133},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.4853469431400299},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3551211655139923},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.27919894456863403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2414867877960205}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7676749229431152},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.603290855884552},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5667575001716614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5505309104919434},{"id":"https://openalex.org/C173644813","wikidata":"https://www.wikidata.org/wiki/Q3527155","display_name":"Robertson\u2013Seymour theorem","level":5,"score":0.5177449584007263},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4981069564819336},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49271324276924133},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.4853469431400299},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3551211655139923},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27919894456863403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2414867877960205},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3465084.3467935","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2008.03091","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2008.03091","pdf_url":"https://arxiv.org/pdf/2008.03091","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2008.03091","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2008.03091","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:3048053168","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2008.03091","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2008.03091","pdf_url":"https://arxiv.org/pdf/2008.03091","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G142137482","display_name":"CAREER: A Theory of Error Correction for Interactive Communication","funder_award_id":"1750808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2962458518","display_name":null,"funder_award_id":"CCF-1910588","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3280610492","display_name":"CIF: Small: New Coding Techniques for Synchronization Errors","funder_award_id":"1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4810324284","display_name":null,"funder_award_id":"CCF-1750808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4825557670","display_name":null,"funder_award_id":"CF-1910588","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G521757348","display_name":null,"funder_award_id":"CF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6751408502","display_name":null,"funder_award_id":"CCF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G99399730","display_name":"AF: Small: Distributed Optimization Beyond Worst Case Topologies","funder_award_id":"1910588","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/W3048053168.pdf","grobid_xml":"https://content.openalex.org/works/W3048053168.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1568961751","https://openalex.org/W1945440063","https://openalex.org/W2005900781","https://openalex.org/W2026798971","https://openalex.org/W2029448190","https://openalex.org/W2030825457","https://openalex.org/W2031198637","https://openalex.org/W2032607682","https://openalex.org/W2035409201","https://openalex.org/W2038643780","https://openalex.org/W2071346873","https://openalex.org/W2073558110","https://openalex.org/W2083323175","https://openalex.org/W2084427019","https://openalex.org/W2145062394","https://openalex.org/W2145492278","https://openalex.org/W2151438396","https://openalex.org/W2172178473","https://openalex.org/W2294674552","https://openalex.org/W2484918492","https://openalex.org/W2493557058","https://openalex.org/W2515165863","https://openalex.org/W2737872496","https://openalex.org/W2774187765","https://openalex.org/W2793058913","https://openalex.org/W2951760736","https://openalex.org/W2962939270","https://openalex.org/W2962991864","https://openalex.org/W2963355678","https://openalex.org/W2963650008","https://openalex.org/W2998130168","https://openalex.org/W3104014862","https://openalex.org/W3199876903","https://openalex.org/W4205300528","https://openalex.org/W4254419859"],"related_works":["https://openalex.org/W2953295821","https://openalex.org/W3204122662","https://openalex.org/W2766479655","https://openalex.org/W2923741782","https://openalex.org/W1594626777","https://openalex.org/W2139539283","https://openalex.org/W2958797051","https://openalex.org/W2951369259","https://openalex.org/W2245961675","https://openalex.org/W3099594434","https://openalex.org/W2885600600","https://openalex.org/W2744400745","https://openalex.org/W2288493152","https://openalex.org/W3102549175","https://openalex.org/W2610789486","https://openalex.org/W1933460752","https://openalex.org/W2963858174","https://openalex.org/W2976937585","https://openalex.org/W2183582012","https://openalex.org/W3001954018"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,90],"any":[3,29],"n-node":[4],"graph":[5],"G":[6],"with":[7,12,39,74],"diameter":[8],"D":[9,15],"admits":[10],"shortcuts":[11],"congestion":[13],"O(\u03b4":[14,20],"log":[16],"n)":[17],"and":[18,37,55,59],"dilation":[19],"D),":[21],"where":[22],"\u03b4":[23],"is":[24,35],"the":[25,93],"maximum":[26],"edge-density":[27],"of":[28,31],"minor":[30],"G.":[32],"Our":[33,47],"proof":[34,89],"simple":[36],"constructive":[38],"a":[40,69,78,86],"tilde\u0398":[41],"(\u03b4":[42],"D)-round1":[43],"distributed":[44],"construction":[45],"algorithm.":[46],"results":[48],"are":[49],"tight":[50],"up":[51],"to":[52],"logarithmic":[53],"factors":[54],"generalize,":[56],"simplify,":[57],"unify,":[58],"strengthen":[60],"several":[61],"prior":[62],"results.":[63],"For":[64],"example,":[65],"for":[66],"graphs":[67,73],"excluding":[68],"fixed":[70],"minor,":[71],"i.e.,":[72],"constant":[75],"\u03b4,":[76],"only":[77],"\u00d5":[79],"(D2)":[80],"bound":[81],"was":[82],"known":[83],"based":[84],"on":[85,92],"very":[87],"technical":[88],"relies":[91],"Robertson-Seymour":[94],"Graph":[95],"Structure":[96],"Theorem.":[97]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}