{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:51Z","type":"conference","publication":"Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","abstract":[{"text":"In this paper, we present a randomized constant factor approximation\r\nalgorithm for the metric minimum facility location problem with uniform\r\ncosts and demands in a distributed setting, in which every point can\r\nopen a facility. In particular, our distributed algorithm uses three\r\ncommunication rounds with message sizes bounded to O(log n) bits where\r\nn is the number of points. We also extend our algorithm to constant\r\npowers of metric spaces, where we also obtain a randomized constant\r\nfactor approximation algorithm.","lang":"eng"}],"author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"first_name":"Joachim","full_name":"Gehweiler, Joachim","last_name":"Gehweiler"},{"last_name":"Lammersen","full_name":"Lammersen, Christiane","first_name":"Christiane"}],"status":"public","year":"2006","user_id":"15415","citation":{"apa":"Sohler, C., Gehweiler, J., &#38; Lammersen, C. (2006). A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.","short":"C. Sohler, J. Gehweiler, C. Lammersen, in: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006.","chicago":"Sohler, Christian, Joachim Gehweiler, and Christiane Lammersen. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” In <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006.","ieee":"C. Sohler, J. Gehweiler, and C. Lammersen, “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem,” in <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006.","ama":"Sohler C, Gehweiler J, Lammersen C. A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In: <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2006.","mla":"Sohler, Christian, et al. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006.","bibtex":"@inproceedings{Sohler_Gehweiler_Lammersen_2006, title={A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem}, booktitle={Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Sohler, Christian and Gehweiler, Joachim and Lammersen, Christiane}, year={2006} }"},"date_created":"2020-09-01T10:38:29Z","_id":"18746","title":"A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem","department":[{"_id":"63"}]}