Algorithmica

, Volume 9, Issue 1, pp 1–22

The slab dividing approach to solve the EuclideanP-Center problem

  • R. Z. Hwang
  • R. C. T. Lee
  • R. C. Chang
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

Authors and Affiliations

  • R. Z. Hwang
    • 1
  • R. C. T. Lee
    • 1
    • 2
  • R. C. Chang
    • 2
    • 3
  1. 1.Institute of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan, Republic of China
  2. 2.Academia SinicaTaipeiTaiwan, Republic of China
  3. 3.Institute of Computer ScienceNational Chiao Tung UniversityHsinchuTaiwan, Republic of China