Algorithms for the m-center problems: A survey

Jonathan Halpern*, Oded Maimon

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

The m-center problem on a graph is to find the location of m-center points on the graph such that, when each vertex is assigned to its nearest center point, the distance of the furthest vertex from its center is minimal. Several algorithms have been proposed for this problem. In their details these solution procedures seem to be quite different from one another. It is difficult to the reader of the literature, partially due to differences in notation, to identify common basic features of the algorithms if such exist. The purpose of this article is to suggest a general framework for these m-center algorithms and show how each of them fits into this framework.

Original languageEnglish
Pages (from-to)90-99
Number of pages10
JournalEuropean Journal of Operational Research
Volume10
Issue number1
DOIs
StatePublished - May 1982
Externally publishedYes

Fingerprint

Dive into the research topics of 'Algorithms for the m-center problems: A survey'. Together they form a unique fingerprint.

Cite this