, Volume 9, Issue 1, pp 1-22

First online:

The slab dividing approach to solve the EuclideanP-Center problem

  • R. Z. HwangAffiliated withInstitute of Computer Science, National Tsing Hua University
  • , R. C. T. LeeAffiliated withInstitute of Computer Science, National Tsing Hua UniversityAcademia Sinica
  • , R. C. ChangAffiliated withAcademia SinicaInstitute of Computer Science, National Chiao Tung University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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(n 2 p−1· logn). In this paper, we present an algorithm with time complexityO(n 0(√P)).

Key words

Computational geometry NP-completeness