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)).
Similar content being viewed by others
References
Aho, A. V., Hopcroft, J. E., and Ullman, J. D.,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
Bentley, J. L., Multidimensional divide and conquer,Comm. ACM, Vol. 23, No. 4, 1980, pp. 214–229.
Drezner, Z., On a modified one-center model,Management Sci., Vol. 27, 1981, pp. 848–851.
Drezner, Z., The P-center problem.-Heuristics and optimal algorithms,J. Oper. Res. Soc., Vol. 35, No. 8, 1984, pp. 741–748.
Drezner, Z., On the rectangular P-center problem,Naval Res. Logist. Quart., Vol. 34, 1987, pp. 229–234.
Edelsbrunner, H.,Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.
Helly, E., Über Mengen konvexer Körper mit gemeinschaftlichen Punkten,Jahresber. Deutsch. Math.-Verein., Vol. 32, 1923, pp. 175–176.
Horowitz, E. and Sahni, S.,Fundamentals of Computer Algorithms, Computer Science Press, Rockville, MD, 1978.
Lipton, R. and Tarjan, R. E., A separator theorem for planar graphs,SIAM J. Appl. Math., Vol. 36, No. 2, 1979, pp. 177–189.
Lipton, R. and Tarjan, R. E., Applications of a planar separator theorem,SIAM J. Comput., Vol. 9, No. 3, 1980, pp. 615–627.
Megiddo, N., Linear-Time algorithms for linear programming inR 3 and related problems,SIAM J. Comput., Vol. 12, No. 4, 1983, pp. 759–776.
Megiddo, N. and Supowit, K. J., On the complexity of some common geometric location problems,SIAM J. Comput., Vol. 13, No. 1, 1984, pp. 1182–1196.
Mehlhorn, K.,Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, Springer-Verlag, Berlin, 1984.
Author information
Authors and Affiliations
Additional information
Communicated by Kurt Mehlhorn
Rights and permissions
About this article
Cite this article
Hwang, R.Z., Lee, R.C.T. & Chang, R.C. The slab dividing approach to solve the EuclideanP-Center problem. Algorithmica 9, 1–22 (1993). https://doi.org/10.1007/BF01185335
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01185335