Highly Influenced

# A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem

@article{Gehweiler2006ADO, title={A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem}, author={Joachim Gehweiler and Christiane Lammersen and Christian Sohler}, journal={Algorithmica}, year={2006}, volume={68}, pages={643-670} }

- Published 2006 in Algorithmica
DOI:10.1007/s00453-012-9690-y

In this paper, we present a randomized constant factor approximation algorithm for the metric minimum facility location problem with uniform costs and demands in a distributed setting, in which every point can open a facility. In particular, our distributed algorithm uses three communication rounds with message sizes bounded to O(log n) bits where n is the number of points. We also extend our algorithm to constant powers of metric spaces, where we also obtain a randomized constant factor… CONTINUE READING

Highly Cited

This paper has 43 citations. REVIEW CITATIONS