Abstract
We consider the capacitated facility location problem with outliers when facility costs are uniform. Our main result is the first constant factor approximation for this problem. We give a local search algorithm that requires only 2 operations and is a 6.372+ \(\epsilon \) approximation. In developing this result we also improve the approximation guarantee of the capacitated facility location problem with uniform facility costs. Our local search algorithm is extremely simple to analyze and is a 3.732+\(\epsilon \) approximation thus improving on the 4-approximation of Kao [12].
Part of this work was done when the second author was at the University of Warwick on a Royal Society Wolfson visiting Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aardal, K., van den Berg, P.L., Gijswijt, D., Li, S.: Approximation algorithms for hard capacitated k-facility location problems. EJOR 242(2), 358–368 (2015)
An, H.C., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. In: FOCS, 2014, pp. 256–265 (2014)
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3), 544–562 (2004)
Bansal, M., Garg, N., Gupta, N.: A 5-approximation for capacitated facility location. In: ESA, pp. 33–144 (2012)
Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location problems. SIAM J. Comput. 34(4), 803–824 (2005)
Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA, pp. 642–651 (2001)
Chen, K.: A constant factor approximation algorithm for k-median clustering with outliers. In: SODA, pp. 826–835 (2008)
Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. In: IPCO, pp. 99–113 (1999)
Dabas, R., Gupta, N.: Capacitated facility location with outliers/penalties. In: Zhang, Y., Miao, D., Mohring, R. (eds.) Computing and Combinatorics. Lecture Notes in Computer Science, vol. 13595, pp. 549–560. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-22105-7_49
Friggstad, Z., Khodamoradi, K., Rezapour, M., Salavatipour, M.R.: Approximation schemes for clustering with outliers. ACM Trans. Algorithms 15(2), 1–26 (2019)
Gupta, A., Moseley, B., Zhou, R.: Structural iterative rounding for generalized k-median problems. In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021. LIPIcs, vol. 198, pp. 1–18 (2021)
Kao, M.: Improved LP-based approximation algorithms for facility location with hard capacities. CoRR abs/2102.06613 (2021)
Krishnaswamy, R., Li, S., Sandeep, S.: Constant approximation for k-median and k-means with outliers via iterative rounding. In: STOC, pp. 646-659 (2018)
Levi, R., Shmoys, D.B., Swamy, C.: LP-based approximation algorithms for capacitated facility location. J. Math. Program. 131(1–2), 365–379 (2012)
Pál, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), Las Vegas, Nevada, USA, pp. 329–338 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Dabas, R., Garg, N., Gupta, N. (2024). Capacitated Facility Location with Outliers and Uniform Facility Costs. In: Vygen, J., Byrka, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2024. Lecture Notes in Computer Science, vol 14679. Springer, Cham. https://doi.org/10.1007/978-3-031-59835-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-59835-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-59834-0
Online ISBN: 978-3-031-59835-7
eBook Packages: Computer ScienceComputer Science (R0)