The slab dividing approach to solve the EuclideanP-Center problem

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,...

Full description

Bibliographic Details
Published in:Algorithmica : an international journal in computer science, Vol. 9 (1993), p. 1-22
Other Involved Persons: Hwang, R. Z. ; Lee, R. C. T. ; Chang, R. C.
Format: electronic Article
Item Description:Copyright: Copyright 1993 Springer-Verlag New York Inc.
Physical Description:Online-Ressource
QR Code: Show QR Code