Article

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

Authors:

Joachim Gehweiler,

Christiane Lammersen,

Christian SohlerAuthors Info & Claims

SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

Pages 237 - 243

https://doi.org/10.1145/1148109.1148152

Published: 30 July 2006 Publication History

Get Access

Abstract

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.

References

[1]

M. Bǎdoiu, A. Czumaj, P. Indyk, and C. Sohler. Facility Location in Sublinear Time. Proceedings of the 32nd Annual International Colloquium on Automata, Languages and Programming (ICALP), volume 3580 of Lecture Notes in Computer Science, pp. 866--877, Lisbon, Portugal, 2005. Springer-Verlag, Berlin.]]

Digital Library

Google Scholar

[2]

M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 378--388, 1999.]]

Digital Library

Google Scholar

[3]

F. A. Chudak. Improved approximation algorithms for uncapacitated facility location. Proceedings of the 6th International Integer Programming and Combinatorial Optimization Conference (IPCO), pp. 180--194, 1998.]]

Crossref

Google Scholar

[4]

D. Fotakis. Memoryless Facility Location in One Pass. Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 608--620, 2006.]]

Digital Library

Google Scholar

[5]

S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31(1): 228--248, 1999.]]

Digital Library

Google Scholar

[6]

K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 731--740, 2002.]]

Digital Library

Google Scholar

[7]

K. Jain and V. Vazirani. Approximaton algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM, 48(2): 274--296, 2001.]]

Digital Library

Google Scholar

[8]

M. Mahdian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 229--242, 2002.]]

Digital Library

Google Scholar

[9]

R. R. Mettu and C. G. Plaxton. The online median problem. In SIAM J. Comput., 32(3): 816--832, 2003.]]

Crossref

Google Scholar

[10]

T. Moscibroda and R. Wattenhofer. Facility Location: Distributed Approximation. In Proceedings of the 24th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pages 108--117, Las Vegas, NV, USA, July 17-20, 2005. ACM Press, New York, NY, USA.]]

Digital Library

Google Scholar

[11]

D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 265--274, 1997.]]

Digital Library

Google Scholar

[12]

M. Thorup. Quick k-median, k-center, and facility location for sparse graphs. SIAM Journal on Computing, 34(2):405--432, 2005.]]

Digital Library

Google Scholar

Cited By

View all

Garimella KDe Francisci Morales GGionis ASozio MBailey JMoffat AAggarwal Cde Rijke MKumar RMurdock VSellis TYu J(2015)Scalable Facility Location for Massive Graphs on Pregel-like SystemsProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806508(273-282)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1145/2806416.2806508
Hegeman JPandurangan GPemmaraju SSardeshmukh VScquizzato MGeorgiou CSpirakis P(2015)Toward Optimal Bounds in the Congested CliqueProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767434(91-100)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767434
Hegeman JPemmaraju S(2014)Lessons from the Congested Clique Applied to MapReduceStructural Information and Communication Complexity10.1007/978-3-319-09620-9_13(149-164)Online publication date: 2014
https://doi.org/10.1007/978-3-319-09620-9_13
Show More Cited By

Index Terms

A distributed O(1)-approximation algorithm for the uniform facility location problem
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Facility location: distributed approximation
PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of communication and the resulting approximation ratio. We give a distributed ...
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing

In this paper, we present a low-diameter decomposition algorithm in the LOCAL model of distributed computing that succeeds with probability 1 − 1/poly(n). Specifically, we show how to compute an (ϵ, O((log n) / ϵ)) low-diameter decomposition in O((log^...
Kinetic Facility Location

We present a deterministic kinetic data structure for the facility location problem that maintains a subset of the moving points as facilities such that, at any point of time, the accumulated cost for the whole point set is at most a constant factor ...

Comments

Information & Contributors

Information

Published In

SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

July 2006

344 pages

ISBN:1595934529

DOI:10.1145/1148109

General Chair:
Phillip B. Gibbons
Intel Research, USA
,
Program Chair:
Uzi Vishkin
UMIACS, University of Maryland, USA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA06

Sponsor:

SPAA06: 18th ACM Symposium on Parallelism in Algorithms and Architectures 2006

July 30 - August 2, 2006

Massachusetts, Cambridge, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
493
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Garimella KDe Francisci Morales GGionis ASozio MBailey JMoffat AAggarwal Cde Rijke MKumar RMurdock VSellis TYu J(2015)Scalable Facility Location for Massive Graphs on Pregel-like SystemsProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806508(273-282)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1145/2806416.2806508
Hegeman JPandurangan GPemmaraju SSardeshmukh VScquizzato MGeorgiou CSpirakis P(2015)Toward Optimal Bounds in the Congested CliqueProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767434(91-100)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767434
Hegeman JPemmaraju S(2014)Lessons from the Congested Clique Applied to MapReduceStructural Information and Communication Complexity10.1007/978-3-319-09620-9_13(149-164)Online publication date: 2014
https://doi.org/10.1007/978-3-319-09620-9_13
Keller MPawlik SPietrzk PKarl H(2013)A Local Heuristic for Latency-Optimized Distributed Cloud DeploymentProceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing10.1109/UCC.2013.85(429-434)Online publication date: 9-Dec-2013
https://dl.acm.org/doi/10.1109/UCC.2013.85
Hegeman JPemmaraju S(2013)A Super-Fast Distributed Algorithm for Bipartite Metric Facility LocationDistributed Computing10.1007/978-3-642-41527-2_36(522-536)Online publication date: 2013
https://doi.org/10.1007/978-3-642-41527-2_36
Berns AHegeman JPemmaraju S(2012)Super-fast distributed algorithms for metric facility locationProceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II10.1007/978-3-642-31585-5_39(428-439)Online publication date: 9-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31585-5_39
Abshoff SCord-Landwehr ADegener BKempkes BPietrzyk P(2011)Local approximation algorithms for the uncapacitated metric facility location problem in power-aware sensor networksProceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities10.1007/978-3-642-28209-6_3(13-27)Online publication date: 8-Sep-2011
https://dl.acm.org/doi/10.1007/978-3-642-28209-6_3
Degener BGehweiler JLammersen C(2010)Kinetic Facility LocationAlgorithmica10.5555/3118227.311848157:3(562-584)Online publication date: 1-Jul-2010
https://dl.acm.org/doi/10.5555/3118227.3118481
Blelloch GTangwongsan Kauf der Heide FPhillips C(2010)Parallel approximation algorithms for facility-location problemsProceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures10.1145/1810479.1810535(315-324)Online publication date: 13-Jun-2010
https://dl.acm.org/doi/10.1145/1810479.1810535
Degener BKempkes BPietrzyk P(2010)A local, distributed constant-factor approximation algorithm for the dynamic facility location problem2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)10.1109/IPDPS.2010.5470349(1-10)Online publication date: Apr-2010
https://doi.org/10.1109/IPDPS.2010.5470349
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Facility location: distributed approximation

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs

Kinetic Facility Location

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations