[1]
P. B. Mirchandani and R. L. Francis, Discrete location theory. New York, NY, USA: John Wiley & Sons, 1990.
[2]
D. B. Shmoys, E. Tardos, and K. Aardal, Approximation algorithms for facility location problems, in Proc. of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, USA, 1997, pp. 265–274.
[3]
S. Li, A 1.488 approximation algorithm for the uncapacitated facility location problem, Inf. Comput., vol. 222, pp. 45–58, 2013.
[4]
M. Sviridenko, An improved approximation algorithm for the metric uncapacitated facility location problem, in Proc. of the 9th Int. Conf. on Integer Programming and Combinatorial Optimization, Copenhagen, Denmark, 2002. pp. 240–257,
[9]
K. Jain, M. Mahdian, and A. Saberi, A new greedyapproach for facility location problems, in Proc. of the 34th Annual ACM Symposium on Theory of Computing, Montréal, Canada, 2002, pp. 731–740.
[10]
M. Mahdian, Y. Ye, and J. Zhang, Improved approximation algorithms for metric facility location problems, in Proc. of 5th International Workshop, APPROX 2002, Rome, Italy, 2002, pp. 229–242.
[11]
V. Arya, N. Garg, R. Khandekar, A. Meyerson, and K. Munagala, Local search heuristic for k-median andfacility location problems, in Proc. of the 33th Annual ACM Symposium on Theory of Computing, Heraklion, Greece, 2001, pp. 21–29.
[13]
M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan, Algorithms for facility location problems with outliers, in Proc. of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, USA, 2001, pp. 642–651.
[14]
R. Ravi and A. Sinha, Multicommodity facility location, in Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, 2004, pp. 342–349.
[15]
M. Mahdian, Facility location and the analysis of algorithms through factor-revealing programs, PhD dissertation, Massachusetts Institute of Technology, Cambridge, MA, USA, 2004.