{"id":"https://openalex.org/W3185869381","doi":"https://doi.org/10.1145/3465084.3467927","title":"Low-Congestion Shortcuts in Constant Diameter Graphs","display_name":"Low-Congestion Shortcuts in Constant Diameter Graphs","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3185869381","doi":"https://doi.org/10.1145/3465084.3467927","mag":"3185869381"},"language":"en","primary_location":{"id":"doi:10.1145/3465084.3467927","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467927","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":"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/A5059790260","display_name":"Shimon Kogan","orcid":"https://orcid.org/0000-0001-8992-9251"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Shimon Kogan","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022875077","display_name":"Merav Parter","orcid":"https://orcid.org/0000-0002-2357-2445"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Merav Parter","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059790260"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":0.4439,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67117905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"203","last_page":"211"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7071136236190796},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5746474862098694},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5730009078979492},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5720705986022949},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5709769129753113},{"id":"https://openalex.org/keywords/dilation","display_name":"Dilation (metric space)","score":0.5473681688308716},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5463243126869202},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5400038957595825},{"id":"https://openalex.org/keywords/arboricity","display_name":"Arboricity","score":0.5217874050140381},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5028180480003357},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.5019726753234863},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45116475224494934},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4236738681793213},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30759114027023315},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.13606956601142883}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7071136236190796},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5746474862098694},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5730009078979492},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5720705986022949},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5709769129753113},{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.5473681688308716},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5463243126869202},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5400038957595825},{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.5217874050140381},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5028180480003357},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.5019726753234863},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45116475224494934},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4236738681793213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30759114027023315},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.13606956601142883},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","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},{"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/3465084.3467927","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467927","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1568961751","https://openalex.org/W1985361054","https://openalex.org/W1992996565","https://openalex.org/W2026798971","https://openalex.org/W2032607682","https://openalex.org/W2083323175","https://openalex.org/W2084206787","https://openalex.org/W2172178473","https://openalex.org/W2294674552","https://openalex.org/W2484918492","https://openalex.org/W2488670996","https://openalex.org/W2615041105","https://openalex.org/W2737872496","https://openalex.org/W2769133055","https://openalex.org/W2774187765","https://openalex.org/W2785528314","https://openalex.org/W2793058913","https://openalex.org/W2951760736","https://openalex.org/W2962991864","https://openalex.org/W2963355678","https://openalex.org/W2964107726","https://openalex.org/W2969287436","https://openalex.org/W2993631756","https://openalex.org/W3015891365","https://openalex.org/W3048053168","https://openalex.org/W3104014862","https://openalex.org/W4205300528","https://openalex.org/W4254419859"],"related_works":["https://openalex.org/W1973112719","https://openalex.org/W2018626253","https://openalex.org/W3013789389","https://openalex.org/W4298370844","https://openalex.org/W2102797028","https://openalex.org/W2546938836","https://openalex.org/W1996859829","https://openalex.org/W1966073846","https://openalex.org/W2103132901","https://openalex.org/W3185869381"],"abstract_inverted_index":{"Low":[0],"congestion":[1,90],"shortcuts,":[2],"introduced":[3],"by":[4,78,147],"Ghaffari":[5],"and":[6,32,66,91],"Haeupler":[7],"(SODA":[8],"2016),":[9],"provide":[10],"a":[11,28,33,49],"unified":[12],"framework":[13],"for":[14,27,143],"global":[15,102],"optimization":[16,103],"problems":[17,104],"in":[18,105],"the":[19,68,97,106],"CONGEST":[20,107],"model":[21],"of":[22,35,70,88,100],"distributed":[23],"computing.":[24],"Roughly":[25],"speaking,":[26],"given":[29],"graph":[30],"G":[31],"collection":[34],"vertex-disjoint":[36],"connected":[37],"subsets":[38],"S1,\u2026,S\u2113":[39],"\u2286V(G),":[40],"(c,d)":[41],"low-congestion":[42],"shortcuts":[43,87,122],"augment":[44],"each":[45,56,71],"subgraph":[46,50,72],"G[Si]":[47,73],"with":[48,112],"Hi":[51,75],"\u2286G":[52],"such":[53],"that:":[54],"(i)":[55],"edge":[57],"appears":[58],"on":[59],"at":[60],"most":[61],"c":[62,126],"subgraphs":[63],"(congestion":[64],"bound),":[65],"(ii)":[67],"diameter":[69,114],"\u222a":[74],"is":[76,83],"bounded":[77],"d":[79,128],"(dilation":[80],"bound).":[81],"It":[82],"desirable":[84],"to":[85],"compute":[86],"small":[89],"dilation":[92],"as":[93],"these":[94],"quantities":[95],"capture":[96],"round":[98],"complexity":[99],"many":[101],"model.":[108],"For":[109],"n-vertex":[110],"graphs":[111],"constant":[113],"D=O(1),":[115],"Elkin":[116],"(STOC":[117],"2004)":[118],"presented":[119],"an":[120],"(implicit)":[121],"lower":[123],"bound":[124],"with1":[125],"+":[127,129],"\u03a9e":[130],"(n":[131],"(D-2)/(2D-2)).":[132],"A":[133],"nearly":[134],"matching":[135],"upper":[136],"bound,":[137],"however,":[138],"was":[139],"only":[140],"recently":[141],"obtained":[142],"D":[144],"\u2208":[145],"{3,4}":[146],"Kitamura":[148],"et":[149],"al.":[150],"(DISC":[151],"2019).":[152]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}