Algorithmica

, Volume 9, Issue 1, pp 1–22

The slab dividing approach to solve the EuclideanP-Center problem

Authors

  • R. Z. Hwang
    • Institute of Computer ScienceNational Tsing Hua University
  • R. C. T. Lee
    • Institute of Computer ScienceNational Tsing Hua University
    • Academia Sinica
  • R. C. Chang
    • Academia Sinica
    • Institute of Computer ScienceNational Chiao Tung University
Article

DOI: 10.1007/BF01185335

Cite this article as:
Hwang, R.Z., Lee, R.C.T. & Chang, R.C. Algorithmica (1993) 9: 1. doi:10.1007/BF01185335

Abstract

Givenn demand points on the plane, the EuclideanP-Center problem is to findP supply points, such that the longest distance between each demand point and its closest supply point is minimized. The time complexity of the most efficient algorithm, up to now, isO(n2p−1· logn). In this paper, we present an algorithm with time complexityO(n0(√P)).

Key words

Computational geometryNP-completeness

Copyright information

© Springer-Verlag New York Inc. 1993