Advertisement

Algorithmica

, Volume 68, Issue 3, pp 643–670 | Cite as

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

  • Joachim Gehweiler
  • Christiane Lammersen
  • Christian Sohler
Article

Abstract

We investigate a metric facility location problem in a distributed setting. In this problem, we assume that each point is a client as well as a potential location for a facility and that the opening costs for the facilities and the demands of the clients are uniform. The goal is to open a subset of the input points as facilities such that the accumulated cost for the whole point set, consisting of the opening costs for the facilities and the connection costs for the clients, is minimized.

We present a randomized distributed algorithm that computes in expectation an \({\mathcal {O}}(1)\)-approximate solution to the metric facility location problem described above. Our algorithm works in a synchronous message passing model, where each point is an autonomous computational entity that has its own local memory and that communicates with the other entities by message passing. We assume that each entity knows the distance to all the other entities, but does not know any of the other pairwise distances. Our algorithm uses three rounds of all-to-all communication with message sizes bounded to \(\mathcal{O}(\log(n))\) bits, where n is the number of input points.

We extend our distributed algorithm to constant powers of metric spaces. For a metric exponent ≥1, we obtain a randomized \({\mathcal {O}}(1)\)-approximation algorithm that uses three rounds of all-to-all communication with message sizes bounded to \(\mathcal{O}(\log(n))\) bits.

Keywords

Facility location Distributed algorithm Randomized approximation algorithm Synchronous message passing model 

References

  1. 1.
    Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3), 544–562 (2004) CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bădoiu, M., Czumaj, A., Indyk, P., Sohler, C.: Facility location in sublinear time. In: Proceedings of the 32nd Annual International Colloquium on Automata, Languages and Programming (ICALP’05), vol. 3580, pp. 866–877. Springer, Berlin (2005) CrossRefGoogle Scholar
  3. 3.
    Byrka, J., Aardal, K.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput. 39(6), 2212–2231 (2010) CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location problems. SIAM J. Comput. 34(4), 803–824 (2005) CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1–25 (2003) CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Gfeller, B., Vicari, E.: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In: Proceedings of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’07), pp. 53–60. Association for Computing Machinery, New York (2007) Google Scholar
  7. 7.
    Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. J. Algorithms 31(1), 228–248 (1999) CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM (JACM) 50(6), 795–824 (2003) CrossRefMathSciNetGoogle Scholar
  9. 9.
    Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC’02), pp. 731–740. Association for Computing Machinery, New York (2002) Google Scholar
  10. 10.
    Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM (JACM) 48(2), 274–296 (2001) CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37(1), 146–188 (2000) CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Mateo (1996) zbMATHGoogle Scholar
  13. 13.
    Mahdian, M., Ye, Y., Zhang, J.: Approximation algorithms for metric facility location problems. SIAM J. Comput. 36(2), 411–432 (2006) CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Mettu, R.R., Plaxton, C.G.: The online median problem. SIAM J. Comput. 32(3), 816–832 (2003) CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Moscibroda, T., Wattenhofer, R.: Facility location: Distributed approximation. In: Proceedings of the 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’05), pp. 108–117. Association for Computing Machinery, New York (2005) CrossRefGoogle Scholar
  16. 16.
    Pandit, S., Pemmaraju, S.V.: Return of the primal-dual: Distributed metric facility location. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC’09), pp. 180–189. Association for Computing Machinery, New York (2009) CrossRefGoogle Scholar
  17. 17.
    Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000) Google Scholar
  18. 18.
    Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC’97), pp. 265–274. Association for Computing Machinery, New York (1997) Google Scholar
  19. 19.
    Sviridenko, M.: An improved approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization (IPCO’02), pp. 240–257. Springer, Berlin (2002) CrossRefGoogle Scholar
  20. 20.
    Thorup, M.: Quick k-median, k-center, and facility location for sparse graphs. SIAM J. Comput. 34(2), 405–432 (2004) CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Joachim Gehweiler
    • 1
  • Christiane Lammersen
    • 2
  • Christian Sohler
    • 3
  1. 1.Heinz Nixdorf Institute and Computer Science DepartmentUniversity of PaderbornPaderbornGermany
  2. 2.School of Computing ScienceSimon Fraser UniversityBurnabyCanada
  3. 3.Department of Computer ScienceTechnische Universität DortmundDortmundGermany

Personalised recommendations