A local, distributed constant-factor approximation algorithm for the dynamic facility location problem

We present a distributed, local solution to the dynamic facility location problem in general metrics, where each node is able to act as a facility or a client. To decide which r ole it should take, each node keeps up a simple invariant in its local neighborhood. This guarantees a global constant factor approximation when the invariant is satisfied at all nodes. Due to the changing distances between nodes, invariants can be violated. We show that restoring the invariants is bounded to a constant neighborhood, takes logarithmic (in the number of nodes) asynchronous rounds and affects each node at most twice per violation.

[1]  Joachim Gehweiler,et al.  A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem , 2006, SPAA '06.

[2]  Éva Tardos,et al.  Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[3]  Francesco Mondada,et al.  SWARM-BOT: from concept to implementation , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[4]  Sariel Har-Peled.  Clustering Motion , 2004, Discret. Comput. Geom..

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

[6]  Ran Wolff,et al.  A Local Facility Location Algorithm for Sensor Networks , 2005, DCOSS.

[7]  Sriram V. Pemmaraju,et al.  Finding Facilities Fast , 2009, ICDCN.

[8]  Joachim Gehweiler,et al.  Kinetic Facility Location , 2008, Algorithmica.

[9]  Jochen H. Schiller,et al.  A Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks , 2008, 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom).

[10]  Leonidas J. Guibas,et al.  Discrete Mobile Centers , 2003, Discret. Comput. Geom..

[11]  Sriram V. Pemmaraju,et al.  Return of the primal-dual: distributed metric facilitylocation , 2009, PODC '09.

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

[13]  Sergey Bereg,et al.  Mobile facility location (extended abstract) , 2000, DIALM '00.

[14]  C. Greg Plaxton,et al.  The online median problem , 1999, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[15]  Kay Römer,et al.  Distributed Facility Location Algorithms for Flexible Configuration of Wireless Sensor Networks , 2007, DCOSS.

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

[17]  Satish Rao,et al.  Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.

[18]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.