{"id":"https://openalex.org/W2484918492","doi":"https://doi.org/10.1145/2933057.2933112","title":"Low-Congestion Shortcuts without Embedding","display_name":"Low-Congestion Shortcuts without Embedding","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2484918492","doi":"https://doi.org/10.1145/2933057.2933112","mag":"2484918492"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933112","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2933057.2933112","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2933112&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2933112&type=pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bernhard Haeupler","orcid":null},"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":true,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Taisuke Izumi","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Taisuke Izumi","raw_affiliation_strings":["Nagoya Institute of Technology, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Nagoya Institute of Technology, Nagoya, Japan","institution_ids":["https://openalex.org/I197274945"]}]},{"author_position":"last","author":{"id":null,"display_name":"Goran Zuzic","orcid":null},"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":"Goran Zuzic","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":3.2347,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.9241349,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"451","last_page":"460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9983999729156494,"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/embedding","display_name":"Embedding","score":0.7214000225067139},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.715399980545044},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6812999844551086},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6010000109672546},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5760999917984009},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.46320000290870667},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45509999990463257}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7214000225067139},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.715399980545044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7006000280380249},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6812999844551086},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6010000109672546},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5760999917984009},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.46320000290870667},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45509999990463257},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45249998569488525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4433000087738037},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.43630000948905945},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43160000443458557},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3458999991416931},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C157369684","wikidata":"https://www.wikidata.org/wiki/Q34740","display_name":"Genus","level":2,"score":0.28450000286102295},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C189216461","wikidata":"https://www.wikidata.org/wiki/Q2443456","display_name":"Topology optimization","level":3,"score":0.257099986076355}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2933057.2933112","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2933057.2933112","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2933112&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1607.07553","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1607.07553","pdf_url":"https://arxiv.org/pdf/1607.07553","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":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/2933057.2933112","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2933057.2933112","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2933112&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4127838089","display_name":null,"funder_award_id":"NSF-BSF","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6438457348","display_name":null,"funder_award_id":"16H02878","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G6590089273","display_name":null,"funder_award_id":"15H00","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7442669385","display_name":null,"funder_award_id":"CCF-1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8991894024","display_name":"AF: Small: Distributed Algorithms for Near-Planar Networks","funder_award_id":"1527110","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"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2484918492.pdf","grobid_xml":"https://content.openalex.org/works/W2484918492.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W37512724","https://openalex.org/W1497938971","https://openalex.org/W1508113861","https://openalex.org/W1582638066","https://openalex.org/W1984090926","https://openalex.org/W2005900781","https://openalex.org/W2030825457","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2048098617","https://openalex.org/W2058191123","https://openalex.org/W2071346873","https://openalex.org/W2084427019","https://openalex.org/W2107282727","https://openalex.org/W2112702616","https://openalex.org/W2116055396","https://openalex.org/W2145492278","https://openalex.org/W2172178473","https://openalex.org/W2294674552"],"related_works":[],"abstract_inverted_index":{"Distributed":[0],"optimization":[1,69,124],"algorithms":[2,125],"are":[3],"frequently":[4],"faced":[5],"with":[6],"solving":[7],"sub-problems":[8],"on":[9,126],"disjoint":[10],"connected":[11],"parts":[12,21],"of":[13,19,29,96],"a":[14,144],"network.":[15,116],"Unfortunately,":[16],"the":[17,27,30,53,58,72,76],"diameter":[18,28],"these":[20,141],"can":[22,49,138],"be":[23,50],"significantly":[24],"larger":[25],"than":[26],"underlying":[31,55],"network,":[32],"leading":[33],"to":[34,67,89,120],"slow":[35],"running":[36],"times.":[37],"Recent":[38],"work":[39,80],"by":[40],"[Ghaffari":[41],"and":[42,110,132],"Hauepler;":[43],"SODA'16]":[44],"showed":[45,100],"that":[46,65,101,136],"this":[47,79,91],"phenomenon":[48],"seen":[51],"as":[52,85],"broad":[54],"reason":[56],"for":[57,106,130],"pervasive":[59],"Omega(\u221an":[60],"+":[61],"D)":[62],"lower":[63],"bounds":[64],"apply":[66],"most":[68],"problems":[70],"in":[71,93,143],"CONGEST":[73],"model.":[74],"On":[75],"positive":[77],"side,":[78],"also":[81],"introduced":[82],"low-congestion":[83],"shortcuts":[84,105,142],"an":[86],"elegant":[87],"solution":[88],"circumvent":[90],"problem":[92],"certain":[94],"topologies":[95],"interest.":[97],"Particularly,":[98],"they":[99],"there":[102],"exist":[103],"good":[104],"any":[107,113],"planar":[108],"network":[109],"more":[111],"generally":[112],"bounded":[114],"genus":[115],"This":[117],"directly":[118],"leads":[119],"fast":[121],"O(DlogO(1)n)":[122],"distributed":[123,145],"such":[127],"topologies,":[128],"e.g.,":[129],"MST":[131],"Min-Cut":[133],"approximation,":[134],"given":[135],"one":[137],"efficiently":[139],"construct":[140],"manner.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2016-08-23T00:00:00"}