New Results on the Complexity of p-Center Problems

@article{Megiddo1983NewRO,
  title={New Results on the Complexity of p-Center Problems},
  author={Nimrod Megiddo and Arie Tamir},
  journal={SIAM J. Comput.},
  year={1983},
  volume={12},
  pages={751-758}
}
An O(n log3 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(n log2 n log log n ) algorithm for a weighted discrete p-center 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…