Key points are not available for this paper at this time.
An m-center set of a graph is any set of m points, belonging either to the edges or vertices, that minimizes the maximum distance from a vertex to its nearest m-center. This paper presents a method for solving the m-center problem by solving a finite series of minimum set covering problems.
Edward Minieka (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: