Megiddo, Nimrod; Tamir, Arie New results on the complexity of p-center problems. (English) Zbl 0521.68037 SIAM J. Comput. 12, 751-758 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 3 ReviewsCited in 54 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68R10 Graph theory (including graph drawing) in computer science 05C05 Trees 68P10 Searching and sorting Keywords:continuous p-center problem on a tree; weighted discrete p-center problem; location; parallel computation; tree partitioning; parametric combinatorial optimization PDFBibTeX XMLCite \textit{N. Megiddo} and \textit{A. Tamir}, SIAM J. Comput. 12, 751--758 (1983; Zbl 0521.68037) Full Text: DOI