Abstract
In this paper, we consider the dynamic k-level facility location problem, which is a generalization of the uncapacitated k-level facility location problem when considering time factor. We present a combinatorial primal-dual approximation algorithm for the problem which finds a solution within 6 times the optimum. This approximation ratio under a dynamic setting coincides with that of the simple dual ascent 6-approximation algorithm for the (static) multilevel facility location problem (Bumb, 2001) with a weak triangle inequality property.
Supported by National Natural Science Foundation of China (Grant Nos. 61425024, 11531011, 11771013, 11871081, 11871280, 11471003), and National Thousand Young Talents Program, and Qing Lan Project.
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., Chudak, F.A., Shmoys, D.B.: A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem. Inf. Process. Lett. 72(5–6), 161–167 (1999)
Ageev, A., Ye, Y., Zhang, J.: Improved combinatorial approximation algorithms for the \(k\)-level facility location problem. SIAM J. Discrete Math. 18(1), 207–217 (2004)
Bumb, A., Kern, W.: A simple dual ascent algorithm for the multilevel facility location problem. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX/RANDOM -2001. LNCS, vol. 2129, pp. 55–63. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44666-4_10
Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119–171. Wiley, New York (1990)
Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228–248 (1999)
Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM (JACM) 48(2), 274–296 (2001)
Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229–242. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45753-4_20
Meyerson, A., Munagala, K., Plotkin, S.: Cost-distance: two metric network design. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 624–630. IEEE (2000)
Shmoys, D.B., Aardal, K.I.: Approximation algorithms for facility location problems, vol. 1997. Utrecht University: Information and Computing Sciences (1997)
Van Roy, T.J., Erlenkotter, D.: A dual-based procedure for dynamic facility location. Manag. Sci. 28(10), 1091–1105 (1982)
Wang, Z., Du, D., Xu, D.: A primal-dual approximation algorithm for the k-level stochastic facility location problem. In: Chen, B. (ed.) AAIM 2010. LNCS, pp. 253–260. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14355-7_26
Xu, D., Du, D.: The k-level facility location game. Oper. Res. Lett. 34(4), 421–426 (2006)
Ye, Y., Zhang, J.: An approximation algorithm for the dynamic facility location problem. In: Cheng, M.X., Li, Y., Du, D.Z. (eds.) Combinatorial Optimization in Communication Networks, vol. 18, pp. 623–637. Springer, Boston (2006). https://doi.org/10.1007/0-387-29026-5_22
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, L., Zhang, Z., Xu, D., Zhang, X. (2019). An Approximation Algorithm for the Dynamic k-level Facility Location Problem. In: Du, DZ., Li, L., Sun, X., Zhang, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2019. Lecture Notes in Computer Science(), vol 11640. Springer, Cham. https://doi.org/10.1007/978-3-030-27195-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-27195-4_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27194-7
Online ISBN: 978-3-030-27195-4
eBook Packages: Computer ScienceComputer Science (R0)