Kariv, O.; Hakimi, S. L. An algorithmic approach to network location problems. I: The p-centers. (English) Zbl 0432.90074 SIAM J. Appl. Math. 37, 513-538 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 204 Documents MSC: 90C35 Programming involving graphs or networks 90B22 Queues and service in operations research 68Q25 Analysis of algorithms and problem complexity 68R10 Graph theory (including graph drawing) in computer science 05C35 Extremal problems in graph theory 05C05 Trees 94C15 Applications of graph theory to circuits and networks Keywords:p-centers; network location; location of service station; servicing; computational complexity; NP-complete problems; polynomial algorithm; graph; tree; centers; medians; centroid; w-centroid; diameter of graph; dominating set; min-max criterion PDF BibTeX XML Cite \textit{O. Kariv} and \textit{S. L. Hakimi}, SIAM J. Appl. Math. 37, 513--538 (1979; Zbl 0432.90074) Full Text: DOI OpenURL