Journal Article10.1145/1824777.1824789
Lower-bounded facility location
59
TL;DR: In this article, the authors considered the lower-bounded facility location problem with lower bound constraints for the number of clients assigned to a facility in the case that this facility is opened.
read more
Abstract: We study the lower-bounded facility location problem which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the number of clients assigned to a facility in the case that this facility is opened. This problem was introduced independently in the papers by Karger and Minkoff [2000] and by Guha et al. [2000], both of which give bicriteria approximation algorithms for it. These bicriteria algorithms come within a constant factor of the optimal solution cost, but they also violate the lower bound constraints by a constant factor. Our result in this article is the first true approximation algorithm for the lower-bounded facility location problem which respects the lower bound constraints and achieves a constant approximation ratio for the objective function. The main technical idea for the design of the algorithm is a reduction to the capacitated facility location problem, which has known constant-factor approximation algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Fair Algorithms for Clustering
TL;DR: In this paper, the authors study the problem of finding low-cost fair clusterings in data where each data point may belong to many protected groups and propose a fair clustering algorithm that allows the user to specify the parameters that define fair representation.
83
On the cost of essentially fair clusterings
Ioana Oriana Bercea,Martin Groß,Samir Khuller,Aounon Kumar,Clemens Rösner,Daniel R. Schmidt,Melanie Schmidt +6 more
- 01 Sep 2019
TL;DR: In this article, the authors proposed a relaxed fairness notion under which they can give bicriteria constant-factor approximations for all of the classical clustering objectives k-center, k-supplier, kmedian, kmeans and facility location.
52
•Dissertation
Approximate shortest path and distance queries in networks
Christian Sommer
- 01 Jan 2010
TL;DR: This thesis investigates the problem of efficiently computing exact and approximate shortest paths in graphs, with the main focus being on shortest path query processing and proves that exploiting well-connected nodes yields efficient distance oracles for scale-free graphs.
Improved Approximation Guarantees for Lower-Bounded Facility Location
Sara Ahmadian,Chaitanya Swamy +1 more
- 13 Sep 2012
TL;DR: In this paper, the authors considered the lower-bounded facility location (LBFL) problem, which is a generalization of uncapacitated facility location, where each open facility is required to serve a certain minimum amount of demand.
33
•Posted Content
Improved Approximation Guarantees for Lower-Bounded Facility Location
Sara Ahmadian,Chaitanya Swamy +1 more
TL;DR: In this paper, the authors considered the load-balanced facility location problem, where each open facility is required to serve a certain minimum amount of demand, and proposed an approximation algorithm with a guarantee of 82.6.
32
References
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation
Kamal Jain,Vijay V. Vazirani +1 more
TL;DR: A new extension of the primal-dual schema and the use of Lagrangian relaxation to derive approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6 respectively.
950
Local Search Heuristics for k -Median and Facility Location Problems
TL;DR: This work analyzes local search heuristics for the metric k-median and facility location problems and shows that local search with swaps has a locality gap of 5 and introduces a new local search operation which opens one or more copies of a facility and drops zero or more facilities.
Approximation algorithms for facility location problems
TL;DR: This note is intended as companion to the lecture at CONF 2000, mainly to give pointers to the appropriate references.
Approximation algorithms for facility location problems (extended abstract)
David B. Shmoys,Éva Tardos,Karen Aardal +2 more
- 04 May 1997
TL;DR: A polynomial-time algorithm is given that finds a solution of cost within a factor of 3.16 of the optimal for the uncapacitated facility location, which is the first constant performance guarantee known for this problem.
Approximation algorithms for facility location problems
David B. Shmoys,Éva Tardos,Karen Aardal +2 more
- 01 Jan 1997
537