{"title":"Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics","authors":"D. Eppstein, Hadi Khodabandeh","doi":"10.1145/3490148.3538553","DOIUrl":null,"url":null,"abstract":"Resolving an open question from 2006, we prove the existence of light-weight bounded-degree (1+ε)-spanners for unit ball graphs in the metrics of bounded doubling dimension, and we design a simple O(log*n)-round distributed algorithm in the LOCAL model for finding such spanners using only 2-hop neighborhood information. We further study the problem in the two dimensional Euclidean plane and we propose a construction with similar properties that has a low-intersection property as well. Lastly, we provide experimental results that confirm the performance of our algorithms.","PeriodicalId":112865,"journal":{"name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","volume":"3586 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3490148.3538553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Resolving an open question from 2006, we prove the existence of light-weight bounded-degree (1+ε)-spanners for unit ball graphs in the metrics of bounded doubling dimension, and we design a simple O(log*n)-round distributed algorithm in the LOCAL model for finding such spanners using only 2-hop neighborhood information. We further study the problem in the two dimensional Euclidean plane and we propose a construction with similar properties that has a low-intersection property as well. Lastly, we provide experimental results that confirm the performance of our algorithms.