[1] Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V. Local search heuristics for k-median and facility location problems[J]. SIAMJournal on Computing, 2004, 33: 544-562. [2] Charikar M, Khuller S, Mount D M, Narasimhan G. Algorithms for facility location problems with outliers[ ]. In Proceedings of 12th annual ACM-SIAM Symposium on Discrete Algorithms, 2001. 642-651. [3] Cohen-Addad V, Klein P, Mathieu C. Local search yields approximation schemes for k-Means and k-median in Euclidean and minor-free metrics[ ]. In Proceedings of 57th IEEE Annual Symposium on Foundations of Computer Science, 2016. 353-364. [4] Du D, Lu R, Xu D. A primal-dual approximation algorithm for the facility location problem with submodular penalties[J]. Algorithmica, 2012, 63: 191-200. [5] Feng Q, Zhang Z, Huang Z, Xu J, Wang J. Improved Algorithms for Clustering with Outliers. In Proceedings of 30th International Symposium on Algorithms and Computation. 2019, article 61. [6] Guha S, Khuller S, Greedy strike back: Improved facility location algorithms[J]. Journal of Algorithms, 1999, 31: 228-248. [7] Gupta S, Kumar R, Lu K, Moseley B, Vassilvitskii S. Local search methods for k-means with outliers[J]. Proceedings of the VLDB Endowment, 2017, 10: 757-768. [8] Geunes J, Levi R, Romeijn H E, Shmoys D B. Approximation algorithms for supply chain planning and logistics problems with market choice[J]. Mathematical Programming, 2011, 130: 85-106. [9] Hayrapetyan A, Swamy C, Tardos E. Network design for information networks. In Proceedings of the 16th annual ACM-SIAM Symposium on Discrete Algorithms, 2005. 933-942. [10] Jain K, Mahdian M, Markakis E, Saberi S, Vazirani V V. Greedy facility location algorithms analyzed using dual fifitting with factor-revealing LP[J]. Journal of the ACM, 2003, 50: 795-824. [11] Jain K, Vazirani V V, Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation[J]. Journal of the ACM, 2001, 48: 274-296. [12] Jiang Y, Xu D, Du D, Zhang D. An approximation algorithm for the dynamic facility location problem with outliers[J]. Optimization Letters, 2019, 13: 561-571. [13] Jiang C, Xu D. An approximation algorithm for the dynamic facility location problem with penalties[J]. Acta Mathematicae Applicatae Sinica, 2009, 6: 5. [14] Krishnaswamy R, Li S, Sandeep S. Constant approximation for k-median and k-means with outliers via iterative rounding[J]. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingJune, 2018. 646-659. [15] Li S, A 1. 488-approximation algorithm for the uncapacitated facility location problem[J]. Information and Computation, 2013, 222: 45-58. [16] Li Y, Du D, Xiu N, Xu D. A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties[J]. Theoretical Computer Science, 2013, 476: 109-117. [17] Li Y, Du D, Xiu N, and Xu D. Improved approximation algorithms for the facility location problems with linear/submodular penalty[J]. Algorithmica, 2015, 13: 561-571. [18] Shmoys D B, Tardos E, Aardal K I, Approximation algorithms for facility location problems[J]. In Proceedings of 29th annual ACM symposium on Theory of computing, 1997. 265-274. [19] Xu G, Xu J. An LP rounding algorithm for approximating uncapacitated facility location problem with penalties[J]. Information Processing Letters, 2005, 94: 119-123. [20] Ye Y, Zhang J W, An approximation algorithm for the dynamic facility location problem[J]. In: Cheng, M.X., Li, Y., Du, D-Z. (eds.) Combinatorial Optimization in Communication Networks, Springer, US, 2006. 623-637. [21] Zanjirani F R, Hekmatfar M. Facility location: concepts, models, algorithms and Case Studies[M]. Physica, Heidelberg, 2009. |