The slab dividing approach to solve the Euclidean P | -Center problem

Given n demand points on the plane, the Euclidean P-Center problem is to find P 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, is O(n2 p−1· log n). In this paper, we pr...

Full description

Bibliographic Details
Published in:Algorithmica : an international journal in computer science, Vol. 9, No. 1 (1993), p. 1-22
Main Author: Hwang, Z.
Other Involved Persons: Lee, T. ; Chang, C.
Format: electronic Article
Language:English
ISSN:1432-0541
Item Description:Communicated by Kurt Mehlhorn
Physical Description:Online-Ressource
DOI:10.1007/BF01185335
Subjects:
QR Code: Show QR Code