A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model
Patrick Briest, Bastian Degener, Barbara Kempkes, Peter Kling, and Peter Pietrzyk

TL;DR
This paper introduces a distributed algorithm for the metric uncapacitated facility location problem that achieves a near-optimal approximation factor in sublinear time within the Congest model, improving efficiency and solution quality.
Contribution
It presents the first distributed approximation algorithm with the best known approximation factor for this problem, using a novel sublinear time selection mechanism.
Findings
Achieves a (1.861 + epsilon) approximation factor.
Runs in O(n^{3/4} log^{2}_{1+epsilon}(n)) rounds with high probability.
Guarantees the approximation factor always, not just in expectation.
Abstract
We present a randomized distributed approximation algorithm for the metric uncapacitated facility location problem. The algorithm is executed on a bipartite graph in the Congest model yielding a (1.861 + epsilon) approximation factor, where epsilon is an arbitrary small positive constant. It needs O(n^{3/4}log_{1+epsilon}^2(n) communication rounds with high probability (n denoting the number of facilities and clients). To the best of our knowledge, our algorithm currently has the best approximation factor for the facility location problem in a distributed setting. It is based on a greedy sequential approximation algorithm by Jain et al. (J. ACM 50(6), pages: 795-824, 2003). The main difficulty in executing this sequential algorithm lies in dealing with situations, where multiple facilities are eligible for opening, but (in order to preserve the approximation factor of the sequential…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Optimization and Search Problems · Facility Location and Emergency Management
