1. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. Society for Industrial and Applied Mathematics. (2004)
2. Baev, I., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks, Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 661–670, USA, (2001)
3. Chan, A., Lau, R., Ng, B.: A hybrid motion prediction method for caching and prefetching in distributed virtual environments. ACM VRST 2001, pp. 135–142 (2001)
4. Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems, Proc. 40th IEEE Symposium on Foundations of Computer Science. 378–388 (1999)
5. Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. STOC’03, June 9–11, 2003, San Diego, California, USA