Geometric complexity of some location problems

Given a set ofn demand points with weightWi,i = 1,2,...,n, in the plane, we consider several geometric facility location problems. Specifically we study the complexity of the Euclidean 1-line center problem, discrete 1-point center problem and a competitive location problem. The Euclidean 1-line center problem is to locate a line which minimizes the maximum weighted distance from the line (or the center) to the demand points. The discrete 1-point center problem is to locate one of the demand points so as to minimize the maximum unweighted distance from the point to other demand points. The competitive location problem studied is to locate a new facility point to compete against an existing facility so that a certain objective function is optimized. An Ω(n logn) lower bound is proved for these problems under appropriate models of computation. Efficient algorithms for these problems that achieve the lower bound and other related problems are also given.

[1]  Richard J. Lipton,et al.  On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..

[2]  Udi Manber,et al.  The complexity of problems on probabilistic, nondeterministic, and alternating decision trees , 1985, JACM.

[3]  Edward M. Reingold,et al.  On the Optimality of Some Set Algorithms , 1972, JACM.

[4]  Z. Drezner.  Competitive location strategies for two facilities , 1982 .

[5]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[6]  D. T. Lee,et al.  Location of Multiple Points in a Planar Subdivision , 1979, Inf. Process. Lett..

[7]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[8]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[9]  Godfried T. Toussaint,et al.  Computing the Width of a Set , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[11]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[12]  James G. Morris,et al.  Linear facility location -- Solving extensions of the basic problem , 1983 .

[13]  S. Hakimi.  On locating new facilities in a competitive environment , 1983 .

[14]  D. Hearn,et al.  Geometrical Solutions for Some Minimax Location Problems , 1972 .

[15]  Nimrod Megiddo,et al.  On the complexity of locating linear facilities in the plane , 1982, Oper. Res. Lett..

[16]  Bruce W. Weide,et al.  On the complexity of computing the measure of ∪[ai,bi] , 1978, CACM.

[17]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[18]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[19]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[20]  Franco P. Preparata.  A Note on Locating a Set of Points in a Planar Subdivision , 1979, SIAM J. Comput..

[21]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[22]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..