An O(nlog ³ n) algorithm for the continuous p-center problem on a tree is presented. Following a sequence of previous algorithms, ours is the first one whose time bound in uniform in p and less than quadratic in n. We also present an O(nlog ² nlog log n) algorithm for a weighted discrete p-center problem.
No takes yet. Share an insight, caveat, or question.
Megiddo et al. (1983) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: