A distributed O(1)-approximation algorithm for the uniform facility location problem

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 approximation algorithm.

[1]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[2]  C. Greg Plaxton,et al.  The Online Median Problem , 1999, SIAM J. Comput..

[3]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[4]  Maxim Sviridenko.  An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2002, IPCO.

[5]  Piotr Indyk,et al.  Facility Location in Sublinear Time , 2005, ICALP.

[6]  Rajmohan Rajaraman,et al.  Analysis of a local search heuristic for facility location problems , 2000, SODA '98.

[7]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[8]  Fabián A. Chudak,et al.  Improved Approximation Algorithms for the Uncapacitated Facility Location Problem , 2003, SIAM J. Comput..

[9]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[10]  Mohammad Mahdian,et al.  Approximation Algorithms for Metric Facility Location Problems , 2006, SIAM J. Comput..

[11]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[12]  Sudipto Guha,et al.  Improved Combinatorial Algorithms for Facility Location Problems , 2005, SIAM J. Comput..

[13]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[14]  Éva Tardos,et al.  Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.

[15]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[16]  Jiawei Zhang,et al.  Approximation algorithms for facility location problems , 2004 .

[17]  Mohammad Mahdian,et al.  Improved Approximation Algorithms for Metric Facility Location Problems , 2002, APPROX.

[18]  Fabián A. Chudak.  Improved Approximation Algorithms for Uncapitated Facility Location , 1998, IPCO.

[19]  Mikkel Thorup,et al.  Quick k-Median, k-Center, and Facility Location for Sparse Graphs , 2001, SIAM J. Comput..

[20]  Roger Wattenhofer,et al.  Facility location: distributed approximation , 2005, PODC '05.

[21]  Beat Gfeller,et al.  A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs , 2007, PODC '07.

[22]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[23]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[24]  Dimitris Fotakis.  Memoryless Facility Location in One Pass , 2006, STACS.