Key points are not available for this paper at this time.
Four closely related minimax location problems are considered. Each involves locating a point in the plane to minimize the maximum distance (plus a possible constant) to a given finite set of points. The distance measures considered are the Euclidean and the rectilinear. In each case efficient, finite solution procedures are given. The arguments are geometrical.
Elzinga et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: