ISSN:
1432-0541
Keywords:
Computational geometry
;
NP-completeness
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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(n 2 p−1· logn). In this paper, we present an algorithm with time complexityO(n 0(√P)).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01185335