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.
No takes yet. Share an insight, caveat, or question.
Edward Minieka (1970) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: