An Algorithm for the p-Center Problem in the Plane

The problem of locating p facilities to service m demand points in a plane, such that each demand point is as close as possible to some facility, is considered. An algorithm based on geometry is given, and some computational results presented. Extensions to the weighted case, the surface of a sphere, and the rectilinear norm are also provided.