Abstract
In the uniform capacitated k-facility location problem (UC-k-FLP), we are given a set of facilities and a set of clients. Every client has a demand. Every facility have an opening cost and an uniform capacity. For each client–facility pair, there is an unit service cost to serve the client with unit demand by the facility. The total demands served by a facility cannot exceed the uniform capacity. We want to open at most k facilities to serve all the demands of the clients without violating the capacity constraint such that the total opening and serving cost is minimized. The main contribution of this work is to present the first combinatorial bi-criteria approximation algorithm for the UC-k-FLP by violating the cardinality constraint.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V (2004) Local search heuristics for \(k\)-median and facility location problems. SIAM J Comput 33:544–562
Aggarwal A, Louis A, Bansal M, Garg N, Gupta N, Gupta S, Jain S (2013) A \(3\)-approximation algorithm for the facility location problem with uniform capacities. Math Program 141:527–547
Aardal K, Van den Berg PL, Gijswijt D, Li S (2015) Approximation algorithms for hard capacitated \(k\)-facility location problems. Eur J Oper Res 242:358–368
Babayev DA (1974) Comments on the note of Frieze. Math Program 7:249–252
Byrka J, Aardal KI (2010) An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J Comput 39:2212–2231
Byrka J, Fleszar K, Rybicki B, Spoerhase J (2013) A constant-factor approximation algorithm for uniform hard capacitated \(k\)-median. CoRR, arXiv:1312.6550
Byrka J, Pensyl T, Rybicki B, Srinivasan A (2014) An improved approximation for \(k\)-median, and positive correlation in budgeted optimization. In: Proceedings of SODA, pp 737–756
Byrka J, Fleszar K, Rybicki B, Spoerhase J (2015) Bi-factor approximation algorithms for hard capacitated \(k\)-median problems. In: Proceedings of SODA, pp 722–736
Byrka J, Rybicki B, Uniyal S (2016) An approximation algorithm for uniform capacitated \(k\)-median problem with \(1+\varepsilon \) capacity violation. In: Proceedings of IPCO, pp 262–274
Charikar M, Guha S (2005) Improved combinatorial algorithms for facility location problems. SIAM J Comput 34:803–824
Charikar M, Guha S, Tardos E, Shmoys DB (2002) A constant-factor approximation algorithm for the \(k\)-median problem. J Comput Syst Sci 1:129–149
Chudak FA, Shmoys DB (2003) Improved approximation algorithms for the uncapacitated facility location problem. SIAM J Comput 33:1–25
Chudak FA, Williamson DP (2005) Improved approximation algorithms for capacitated facility location problems. Math Program 102:207–222
Demirci G, Li S (2016) Constant approximation for capacitated \(k\)-median with \((1+\epsilon ) \)-capacity violation. In: Proceedings of ICALP, Article No. 73, pp 73:1–73:14
Guha S, Khuller S (1999) Greedy strikes back: improved facility location algorithms. J Algorithms 31:228–248
Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and \(k\)-median problems using the primal-dual schema and Lagrangian relaxation. J ACM 48:274–296
Jain K, Mahdian M, Saberi A (2002) A new greedy approach for facility location problems. In: Proceedings of STOC, pp 731–740
Jain K, Mahdian M, Markakis E, Saberi A, Vazirani V (2003) Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J ACM 50:795–824
Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Manag Sci 9:643–666
Korupolu MR, Plaxton CG, Rajaraman R (2000) Analysis of a local search heuristic for facility location problems. J Algorithms 37:146–188
Li S (2013) A \(1.488\) approximation algorithm for the uncapacitated facility location problem. Inf Comput 222:45–58
Li S (2015) On uniform capacitated \(k\)-median beyond the natural LP relaxation. In: Proceedings of SODA, pp 696–707
Li S, Svensson O (2016) Approximating \(k\)-median via pseudo-approximation. SIAM J Comput 45:530–547
Manne AS (1964) Plant location under economies-of-scale-decentralization and computation. Manag Sci 11:213–235
Mahdian M, Ye Y, Zhang J (2002) Improved approximation algorithms for metric facility location problems. In: Proceedings of APPROX, pp 229–242
Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions: I. Math Program 14:265–294
Sviridenko M (2002) An improved approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of IPCO, pp 240–257
Shmoys DB, Tardos E, Aardal K (1997) Approximation algorithms for facility location problems. In: Proceedings of SOTC, pp 265–274
Shu J, Teo CP, Shen ZJM (2005) Stochastic transportation-inventory network design problem. Oper Res 53:48–60
Teo CP, Shu J (2004) Warehouse-retailer network design problem. Oper Res 52:396–408
Zhang P (2007) A new approximation algorithm for the \(k\)-facility location problem. Theor Comput Sci 384:126–135
Zhang J, Chen B, Ye Y (2005) A multiexchange local search algorithm for the capacitated facility location problem. Math Oper Res 30:389–403
Acknowledgements
The second author is supported by Natural Science Foundation of China (No. 11531014). The third author is supported by Natural Sciences and Engineering Research Council of Canada (NSERC) Grant 283106. The fourth author is supported by Higher Educational Science and Technology Program of Shandong Province (No. J15LN22).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Han, L., Xu, D., Du, D. et al. A local search approximation algorithm for the uniform capacitated k-facility location problem. J Comb Optim 35, 409–423 (2018). https://doi.org/10.1007/s10878-017-0179-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-017-0179-0