Super-Fast Distributed Algorithms for Metric Facility Location

  • Andrew Berns
  • James Hegeman
  • Sriram V. Pemmaraju
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7392)


This paper presents a distributed O(1)-approximation algorithm in the \(\mathcal{CONGEST}\) model for the metric facility location problem on a size-n clique network that has an expected running time of O(loglogn ·log* n) rounds. Though metric facility location has been considered by a number of researchers in low-diameter settings, this is the first sub-logarithmic-round algorithm for the problem that yields an O(1)-approximation in the setting of non-uniform facility opening costs. Since the facility location problem is specified by Ω(n 2) bits of information, any fast solution in the \(\mathcal{CONGEST}\) model must be truly distributed. Our paper makes three main technical contributions. First, we show a new lower bound for metric facility location. Next, we demonstrate a reduction of the distributed metric facility location problem to the problem of computing an O(1)-ruling set of an appropriate spanning subgraph. Finally, we present a sub-logarithmic-round (in expectation) algorithm for computing a 2-ruling set in a spanning subgraph of a clique. Our algorithm accomplishes this by using a combination of randomized and deterministic sparsification.


Facility Location Facility Location Problem Span Subgraph Unit Disk Graph Communication Round 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Balinski, M.: On finding integer solutions to linear programs. In: Proceedings of IBM Scientific Computing Symposium on Combinatorial Problems, pp. 225–248 (1966)Google Scholar
  2. 2.
    Bădoiu, M., Czumaj, A., Indyk, P., Sohler, C.: Facility Location in Sublinear Time. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 866–877. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Cornuejols, G., Nemhouser, G., Wolsey, L.: Discrete Location Theory. Wiley (1990)Google Scholar
  4. 4.
    Eede, M.V., Hansen, P., Kaufman, L.: A plant and warehouse location problem. Operational Research Quarterly 28(3), 547–554 (1977)zbMATHCrossRefGoogle Scholar
  5. 5.
    Frank, C.: Facility Location. In: Wagner, D., Wattenhofer, R. (eds.) Algorithms for Sensor and Ad Hoc Networks. LNCS, vol. 4621, pp. 131–159. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Gehweiler, J., Lammersen, C., Sohler, C.: A distributed O(1)-approximation algorithm for the uniform facility location problem. In: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2006, pp. 237–243. ACM Press, New York (2006)CrossRefGoogle Scholar
  7. 7.
    Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 649–657. Society for Industrial and Applied Mathematics (1998)Google Scholar
  8. 8.
    Hamburger, M.J., Kuehn, A.A.: A heuristic program for locating warehouses. Management Science 9(4), 643–666 (1963)CrossRefGoogle Scholar
  9. 9.
    Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local Computation: Lower and Upper Bounds. CoRR abs/1011.5470 (2010)Google Scholar
  10. 10.
    Lenzen, C., Wattenhofer, R.: Brief announcement: Exponential speed-up of local algorithms using non-local communication. In: Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 295–296. ACM (2010)Google Scholar
  11. 11.
    Li, S.: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 77–88. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Lotker, Z., Patt-Shamir, B., Pavlov, E., Peleg, D.: Minimum-weight spanning tree construction in O(log log n) communication rounds. SIAM J. Comput. 35(1), 120–131 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Mettu, R.R., Plaxton, C.G.: The online median problem. SIAM J. Comput. 32(3), 816–832 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Moscibroda, T., Wattenhofer, R.: Facility location: distributed approximation. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, pp. 108–117. ACM Press, New York (2005)CrossRefGoogle Scholar
  15. 15.
    Pandit, S., Pemmaraju, S.V.: Finding Facilities Fast. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol. 5408, pp. 11–24. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  16. 16.
    Pandit, S., Pemmaraju, S.V.: Return of the primal-dual: distributed metric facility location. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC 2009, pp. 180–189. ACM Press, New York (2009)CrossRefGoogle Scholar
  17. 17.
    Pandit, S., Pemmaraju, S.V.: Rapid randomized pruning for fast greedy distributed algorithms. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 325–334. ACM (2010)Google Scholar
  18. 18.
    Patt-Shamir, B., Teplitsky, M.: The round complexity of distributed sorting: extended abstract. In: PODC, pp. 249–256. ACM Press (2011)Google Scholar
  19. 19.
    Peleg, D.: Distributed computing: a locality-sensitive approach, vol. 5. Society for Industrial and Applied Mathematics (2000)Google Scholar
  20. 20.
    Schneider, J., Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth-bounded graphs. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, pp. 35–44. ACM (2008)Google Scholar
  21. 21.
    Stollsteimer, J.F.: A working model for plant numbers and locations. Journal of Farm Economics 45(3), 631–645 (1963)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Andrew Berns
    • 1
  • James Hegeman
    • 1
  • Sriram V. Pemmaraju
    • 1
  1. 1.Department of Computer ScienceThe University of IowaIowa CityUSA

Personalised recommendations