1. Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Sacriston, V.: The farthest color voronoi diagram and related problems. In: 17th European Workshop on Computational Geometry (2001)
2. Agarwal, P.K., Sharir, M., Welzl, E.: The discrete 2-center problem. In: 13th Annual Symposium on Computational Geometry, pp. 147–155 (1997)
3. Alt, H., Arkin, E.M., Bronnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost Coverage of point sets by disks. In: Proc. 22nd Annual ACM Symposium on Computational Geometry, pp. 449–458 (2006)
4. Brass, P., Knauer, C., H.-S. Na, C.-S. Shin, Vigneron, A.: Computing k-centers on a line Technical Report CoRR abs/0902.3282 (2009)
5. Lecture Notes in Computer Science;P. Bose,2002