1. Baev, I.D., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 661–670 (2001)
2. Baev, I.D., Rajaraman, R., Swamy, C.: Approximation algorithms for data placement problems. SIAM J. Comput. 38(4), 1411–1429 (2008)
3. Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms 15(3), 385–415 (1993)
4. Charikar, M., Khuller, S.: A robust maximum completion time measure for scheduling. In: ACM–SIAM Symposium on Discrete Algorithms, pp. 324–333 (2006)
5. Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 642–651 (2001)