Abstract
In the universal facility location problem, we are given a set of clients and facilities. Our goal is to find an assignment such that the total connection and facility cost is minimized. The connection cost is proportional to the distance between each client and its assigned facility, whereas the facility cost is a nondecreasing function with respect to the total number of clients assigned to the facility. The universal facility location problem generalizes several classical facility location problems, including the uncapacitated facility location problem and the capacitated facility location problem (both hard and soft capacities). This work considers the universal facility location problem with linear penalties, where each client can be rejected for service with a penalty. The objective is to minimize the total connection, facility and penalty cost. We present a \((5.83+\epsilon )\)-approximation local search algorithm for this problem.
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
Similar content being viewed by others
References
Aggarwal, A., Anand, L., Bansal, M., Garg, N., Gupta, N., Gupta, S., Jain, S.: A 3-approximation for facility location with uniform capacities. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 149–162. Springer, Heidelberg (2010)
An, H.C., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. In: Proceedings of the 55th Annual Symposium on Foundations of Computer Science, pp. 256–265 (2014)
Angel, E., Thang, N.K., Regnault, D.: Improved local search for universal facility location. J. Comb. Optim. 29, 237–246 (2015)
Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 642–651 (2001)
Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 99–113. Springer, Heidelberg (1999)
Gupta, N., Gupta, S.: Approximation algorithms for capacitated facility location problem with penalties. arXiv:1408.4944 (2014)
Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37, 146–188 (2000)
Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear/submodular penalties. Algorithmica 73, 460–482 (2015)
Mahdian, M., Pál, M.: Universal facility location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. lncs, vol. 2832, pp. 409–421. Springer, Heidelberg (2003)
Pal, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pp. 329–338 (2001)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
Vygen, J.: From stars to comets: improved local search for universal facility location. Oper. Res. Lett. 35, 427–433 (2007)
Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. Inf. Process. Lett. 94, 119–123 (2005)
Xu, G., Xu, J.: An improved approximation algorithm for uncapacitated facility location problem with penalties. J. Comb. Optim. 17, 424–436 (2009)
Zhang, J., Chen, B., Ye, Y.: A multiexchange local search algorithm for the capacitated facility location problem. Math. Oper. Res. 30, 389–403 (2005)
Acknowledgements
The research of the first author is supported by Collaborative Innovation Center on Beijing Society-Building and Soccial Governance. The second author’s research is supported by NSFC (Nos. 11371001 and 11531014). The third author’s research is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) grant 283106. The fourth author’s research is supported by NSFC (No. 11501412).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Xu, Y., Xu, D., Du, D., Wu, C. (2015). A \((5.83+\epsilon )\)-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-26626-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26625-1
Online ISBN: 978-3-319-26626-8
eBook Packages: Computer ScienceComputer Science (R0)