# A local search approximation algorithm for a squared metric *k*-facility location problem

- 81 Downloads

## Abstract

In this paper, we introduce a squared metric *k*-facility location problem (SM-*k*-FLP) which is a generalization of the squared metric facility location problem and *k*-facility location problem (*k*-FLP). In the SM-*k*-FLP, we are given a client set \(\mathcal {C}\) and a facility set \(\mathcal {F} \) from a metric space, a facility opening cost \(f_i \ge 0\) for each \( i \in \mathcal {F}\), and an integer *k*. The goal is to open a facility subset \(F \subseteq \mathcal {F}\) with \( |F| \le k\) and to connect each client to the nearest open facility such that the total cost (including facility opening cost and the sum of squares of distances) is minimized. Using local search and scaling techniques, we offer a constant approximation algorithm for the SM-*k*-FLP.

## Keywords

Approximation algorithm Facility location Local search## Notes

### Acknowledgements

The research of the first author is supported by Higher Educational Science and Technology Program of Shandong Province (No. J15LN22). The second author is supported by Natural Science Foundation of China (No. 11531014). The fourth author is supported by Natural Science Foundation of China (No. 61672323) and Natural Science Foundation of Shandong Province (ZR2016AM28). The fifth author is supported by Beijing Excellent Talents Funding (No. 2014000020124G046). A preliminary version of the paper appeared in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications, Shanghai, China, 2017.

## 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–562MathSciNetCrossRefzbMATHGoogle Scholar
- Byrka J, Aardal KI (2010) An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J Comput 39:2212–2231MathSciNetCrossRefzbMATHGoogle Scholar
- 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
- Charikar M, Guha S (2005) Improved combinatorial algorithms for facility location problems. SIAM J Comput 34:803–824MathSciNetCrossRefzbMATHGoogle Scholar
- 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–149MathSciNetCrossRefzbMATHGoogle Scholar
- Chen X, Chen B (1999) Approximation algorithms for soft-capacitated facility location in capacitated network design. Algorithmica 53:263–297MathSciNetCrossRefzbMATHGoogle Scholar
- Chudak FA, Shmoys DB (2003) Improved approximation algorithms for the uncapacitated facility location problem. SIAM J Comput 33:1–25MathSciNetCrossRefzbMATHGoogle Scholar
- Fernandes CG, Meira LA, Miyazawa FK, Pedrosa LL (2015) A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math Program 153:655–685MathSciNetCrossRefzbMATHGoogle Scholar
- Guha S, Khuller S (1999) Greedy strikes back: improved facility location Algorithms. J Algorithms 31:228–248MathSciNetCrossRefzbMATHGoogle Scholar
- 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–824MathSciNetCrossRefzbMATHGoogle Scholar
- 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–296MathSciNetCrossRefzbMATHGoogle Scholar
- Kanungo T, Mount DM, Netanyahu NS, Piatko CD, Silverman R, Wu AY (2004) A local search approximation algorithm for \(k\)-means clustering. Comput Geom Theory Appl 2:89–112MathSciNetCrossRefzbMATHGoogle Scholar
- Li S (2013) A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf Comput 222:45–58MathSciNetCrossRefzbMATHGoogle Scholar
- Li S, Svensson O (2016) Approximating \(k\)-median via pseudo-approximation. SIAM J Comput 45:530–547MathSciNetCrossRefzbMATHGoogle Scholar
- Mahdian M, Ye Y, Zhang J (2006) Approximation algorithms for metric facility location problems. SIAM J Comput 36:411–432MathSciNetCrossRefzbMATHGoogle Scholar
- Shmoys DB, Tardos E, Aardal K (1997) Approximation algorithms for facility location problems. In: Proceedings of SOTC, pp 265–274Google Scholar
- Zhang J, Chen B, Ye Y (2005) A multiexchange local search algorithm for the capacitated facility location problem. Math Oper Res 30:389–403MathSciNetCrossRefzbMATHGoogle Scholar
- Zhang P (2007) A new approximation algorithm for the \(k\)-facility location problem. Theor Comput Sci 384:126–135MathSciNetCrossRefzbMATHGoogle Scholar