A local search approximation algorithm for the uniform capacitated k-facility location problem
- 125 Downloads
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.
Keywordsk-Facility location Uniform capacitated Approximation algorithm Local search
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).
- 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–756Google Scholar
- 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–736Google Scholar
- 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–274Google Scholar
- 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:14Google Scholar
- Jain K, Mahdian M, Saberi A (2002) A new greedy approach for facility location problems. In: Proceedings of STOC, pp 731–740Google Scholar
- Li S (2015) On uniform capacitated \(k\)-median beyond the natural LP relaxation. In: Proceedings of SODA, pp 696–707Google Scholar
- Mahdian M, Ye Y, Zhang J (2002) Improved approximation algorithms for metric facility location problems. In: Proceedings of APPROX, pp 229–242Google Scholar
- Sviridenko M (2002) An improved approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of IPCO, pp 240–257Google Scholar
- Shmoys DB, Tardos E, Aardal K (1997) Approximation algorithms for facility location problems. In: Proceedings of SOTC, pp 265–274Google Scholar