{"id":"https://openalex.org/W4380874519","doi":"https://doi.org/10.1145/3583668.3594561","title":"Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs","display_name":"Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380874519","doi":"https://doi.org/10.1145/3583668.3594561"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594561","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 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/A5102766430","display_name":"Jinfeng Dou","orcid":"https://orcid.org/0009-0004-8852-5182"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jinfeng Dou","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026600778","display_name":"Thorsten G\u00f6tte","orcid":"https://orcid.org/0000-0001-9798-6993"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thorsten G\u00f6tte","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051903032","display_name":"Henning Hillebrandt","orcid":"https://orcid.org/0009-0007-7029-0014"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Hillebrandt","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063355098","display_name":"Christian Scheideler","orcid":"https://orcid.org/0000-0002-5278-528X"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Scheideler","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084662645","display_name":"Julian Werthmann","orcid":"https://orcid.org/0000-0002-5110-5625"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Julian Werthmann","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5102766430"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12465153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"67","last_page":"70"},"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.9993000030517578,"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.9993000030517578,"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.9987000226974487,"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.9952999949455261,"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.7163472771644592},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6793243288993835},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5916299223899841},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5583338141441345},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5233884453773499},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.45352703332901},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4489542245864868},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41516998410224915},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34505635499954224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.315122127532959},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25007057189941406},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2131856381893158},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1694924533367157}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7163472771644592},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6793243288993835},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5916299223899841},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5583338141441345},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5233884453773499},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.45352703332901},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4489542245864868},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41516998410224915},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34505635499954224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.315122127532959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25007057189941406},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2131856381893158},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1694924533367157},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583668.3594561","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1426318481","display_name":null,"funder_award_id":"grant","funder_id":"https://openalex.org/F4320322725","funder_display_name":"China Scholarship Council"},{"id":"https://openalex.org/G4748229160","display_name":null,"funder_award_id":"160364472","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5457134835","display_name":null,"funder_award_id":"GZ: SFB 901/3","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8026673714","display_name":null,"funder_award_id":"SFB 901","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8290965089","display_name":null,"funder_award_id":"SFB 901/3","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8589651859","display_name":null,"funder_award_id":"China","funder_id":"https://openalex.org/F4320322725","funder_display_name":"China Scholarship Council"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1492516078","https://openalex.org/W2057994027","https://openalex.org/W2096304547","https://openalex.org/W2097855961","https://openalex.org/W2169528477","https://openalex.org/W2172213884","https://openalex.org/W2774187765","https://openalex.org/W2810930637","https://openalex.org/W2951760736","https://openalex.org/W2953292887","https://openalex.org/W2963530248","https://openalex.org/W3004044812","https://openalex.org/W3008905547","https://openalex.org/W4221155774","https://openalex.org/W4221161223","https://openalex.org/W4281700498","https://openalex.org/W4281778715","https://openalex.org/W4313227251"],"related_works":["https://openalex.org/W4206327962","https://openalex.org/W2010009304","https://openalex.org/W1996851061","https://openalex.org/W3021694725","https://openalex.org/W2025195393","https://openalex.org/W2940695648","https://openalex.org/W3216105633","https://openalex.org/W1701875187","https://openalex.org/W2990956612","https://openalex.org/W2906860838"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,51,61,76,96],"problem":[3],"of":[4,46,99],"computing":[5],"a":[6,11,25,33,70],"compact":[7],"routing":[8,34,44],"scheme":[9,35],"for":[10],"weighted":[12],"undirected":[13],"planar":[14],"graph":[15],"G":[16],":=":[17],"(V,":[18],"E,":[19],"w)":[20],"in":[21,69,86],"several":[22],"models.":[23],"For":[24],"given":[26],"parameter":[27],"\u03f5":[28,40],">":[29],"0,":[30],"we":[31,94],"compute":[32],"with":[36,72,108],"stretch":[37],"1":[38],"+":[39],"and":[41,43,75,101,105],"labels":[42],"tables":[45],"size":[47],"\u00d5(\u03f5\u22121).":[48],"In":[49],"CONGEST,":[50],"construction":[52],"takes":[53,66],"\u00d5(\u03f5\u22123":[54],"\u00b7":[55],"HD)":[56],"time,":[57],"where":[58],"HD":[59],"denotes":[60],"network's":[62],"hop-diameter.":[63],"Further,":[64],"it":[65,107],"\u00d5(\u03f5\u22123)":[67],"time":[68],"PRAM":[71],"O(n)":[73],"processors":[74],"novel":[77],"HYBRID":[78],"model.":[79],"Thus,":[80],"our":[81],"algorithms":[82,113],"are":[83],"almost":[84],"optimal":[85],"all":[87],"relevant":[88],"parameters.":[89],"To":[90],"achieve":[91],"these":[92],"results,":[93],"extend":[95],"divide-and-conquer":[97],"framework":[98],"Li":[100],"Parter":[102],"[STOC":[103,114],"'19]":[104],"combine":[106],"state-of-the-art":[109],"distributed":[110],"distance":[111],"approximation":[112],"'22].":[115]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}