1. E. Kh. Gimadi, “An Effective Algorithm for Solving the Location Problem with Service Regions Connected with Respect an Acyclic Network,” Upravlyaemye Sistemy 23, 12–23 (1983).
2. A. A. Ageev, “A Criterion of Polynomial Time Solvability for the Network Location Problem,” in Integer Programming and Combinatorial Optimization (Campus Printing, Carnegie Mellon Univ., 1992), pp. 237–245.
3. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, “Local Search Heuristics for k-Median and Facility Location Problems,” SIAM J. Comput. 33(3), 544–562 (2004).
4. R. Bhatia, S. Guha, S. Khuller, and Y. J. Sussmann, “Facility Location with Dynamic Distance Function,” J. Combin. Optim. 2(3), 199–217 (1998).
5. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan, “Algorithms for Facility Location Problems with Outliers,” in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001) (ACM Press, New York, 2001), pp. 642–651.