Abstract
The k-level Uncapacitated Facility Location (UFL) problem is a generalization of the UFL and the k-median problems. A significant shortcoming of the classical UFL problem is that often a few very distant customers, known as outliers, can leave an undesirable effect on the final solution. This deficiency is considered in a new variant called UFL with outliers, in which, in contrast to the other problems that need all of the customers to be serviced, there is no need to service the entire set of customers. UFL with Penalties (UFLWP) is a variant of the UFL with outliers problem in which we will decide on whether to provide service for each customer and pay the connection cost, or to reject it and pay the penalty. In this paper we will propose a new 4-approximation algorithm for the UFLWP which is the first algorithm for this kind of 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
Preview
Unable to display preview. Download preview PDF.
References
Sahin, G., Sural, H.: A review of hierarchical facility location models. J. Computers & Operations Research 34(8), 2310–2331 (2007)
Arya, V., Garg, N., Khandekar, R., Munagala, K., Pandit, V.: Local search heuristic for -median and facility location problems. In: Proceedings of the Thirty-Third Annual ACM Symposium on theory of Computing (STOC 2001), Hersonissos, Greece, pp. 21–29. ACM Press, New York (2001)
Shmoys, D.: Approximation Algorithms For Facility Location Problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 27–32. Springer, Heidelberg (2000)
Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795–824 (2003)
Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. J. Information Processing Letters (94), 119–123 (2005)
Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1–10 (1998)
Xu, D., Du, D.: The -level facility location game. J. Operations Research Letters 34(4), 421–426 (2006)
Aardal, K., Chudak, F.A., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. J. Information Processing Letters 72(5-6), 161–167 (1999)
Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM (48), 274–296 (2001)
Zhang, P.: A new approximation algorithm for the k-facility Location Problem. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 217–230. Springer, Heidelberg (2006)
Charikar, M., Khuller, S., Mount, D., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of Symposium on Discrete Algorithms, pp. 642–651 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asadi, M., Niknafs, A., Ghodsi, M. (2008). An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-89985-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89984-6
Online ISBN: 978-3-540-89985-3
eBook Packages: Computer ScienceComputer Science (R0)