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...
|Published in:||Algorithmica : an international journal in computer science, Vol. 9, No. 1 (1993), p. 1-22|
|Other Involved Persons:||;|
|Item Description:||Communicated by Kurt Mehlhorn|
|QR Code:||Show QR Code|