An approximation algorithm for k-center problem on a convex polygon

Agarwal PK, Guibas LJ, Saxe J, Shor PW (1987) A linear time algorithms for computing the Voronoi diagram of a convex polygon. In: Proceedings of the 19th annual ACM symposium on theory of computing, pp 39–45

Agarwal PK, Sharir M, Toledo S (1994) Applications of parametric searching in geometric optimization. J Algorithms 17:292–318

Agarwal PK, Sharir M (1998) Efficient algorithms for geometric optimization. ACM Comput Surv 30:412–458

Bose P, Toussaint G (1996) Computing the constrained Euclidean, geodesic and link center of a simple polygon with applications. In: Proc of pacific graphics international, pp 102–112

Brass P, Knauer C, Na HS, Shin CS (2009) Computing k-centers on a line. CoRR abs/ 0902.3282

Das GK, Roy S, Das S, Nandy SC (2008) Variations of base station placement problem on the boundary of a convex region. Int J Found Comput Sci 19(2):405–427

Halperin D, Sharir M, Goldberg K (2002) The 2-center problem with obstacles. J Algorithms 42:109–134

Hurtado F, Sacriscan V, Toussaint G (2000) Facility location problems with constraints. Stud Locat Anal 15:17–35

Kim SK, Shin CS (2000) Efficient algorithm for two-center problems for a convex polygon. In: Proceedings of the 6th international computing and combinatorics conference, Ban, NY, pp 299–309

Roy S, Bardhan D, Das S (2008) Base station placement on boundary of a convex polygon. J Parallel Distrib Comput 68:265–273

Suzuki A, Drezner Z (1996) The p-center location problem in area. Location Sci 4:69–82