Locating two obnoxious facilities using the weighted maximin criterion

Given are a finite set of points P and a compact polygonal set S in R^2. The problem is to locate two new facilities in S, maximizing the minimum of all weighted distances between the points in P and the two new facilities, and the distance between the pair of new facilities. We present subquadratic algorithms.

[1]  Arie Tamir,et al.  Obnoxious Facility Location on Graphs , 1991, SIAM J. Discret. Math..

[2]  E. Erkut.  The discrete p-dispersion problem , 1990 .

[3]  Erhan Erkut,et al.  Analytical models for locating undesirable facilities , 1989 .

[4]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

[5]  Nimrod Megiddo,et al.  New Results on the Complexity of p-Center Problems , 1983, SIAM J. Comput..

[6]  Matthew J. Katz,et al.  Obnoxious facility location: Complete service with minimal harm , 2000, CCCG.

[7]  Eitan Zemel.  On search over rationals , 1981, Oper. Res. Lett..

[8]  Zvi Drezner,et al.  THE LOCATION OF AN OBNOXIOUS FACILITY WITH RECTANGULAR DISTANCES , 1983 .

[9]  Prosenjit Bose,et al.  Algorithms for Packing Two Circles in a Convex Polygon , 1998, JCDCG.

[10]  Arie Tamir,et al.  THE SINGLE FACILITY LOCATION PROBLEM WITH MINIMUM DISTANCE CONSTRAINTS. , 1997 .

[11]  Emanuel Melachrinoudis,et al.  An O(mn2) algorithm for the Maximin problem in E2 , 1995, Oper. Res. Lett..

[12]  Mikhail J. Atallah,et al.  An efficient parallel algorithm for the row minima of a totally monotone matrix , 1991, SODA '91.

[13]  Michael T. Goodrich,et al.  Sweep methods for parallel computational geometry , 1996, Algorithmica.

[14]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[15]  Ioannis Giannikos.  Optimal location of single and multiple obnoxious facilities : algorithms for the maximin criterion under different norms , 1993 .

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

[17]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[18]  Donald B. Johnson,et al.  The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

[19]  Robert S. Garfinkel,et al.  The generalized diameter of a graph , 1982, Networks.

[20]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[21]  Godfried T. Toussaint,et al.  Computing largest empty circles with location constraints , 1983, International Journal of Computer & Information Sciences.

[22]  Michael T. Goodrich,et al.  Fast Randomized Parallel Methods for Planar Convex Hull Construction , 1997, Comput. Geom..

[23]  Donald B. Johnson,et al.  Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures , 1983, J. Algorithms.

[24]  R. Garfinkel,et al.  Locating an Obnoxious Facility on a Network , 1978 .

[25]  Sergey Bereg,et al.  Optimal Facility Location Under Various Distance Functions , 2000, Int. J. Comput. Geom. Appl..

[26]  Elmar Schömer,et al.  Subquadratic algorithms for the weighted maximin facility location problem , 1995, CCCG.

[27]  Richard Cokt.  Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms , 1984 .

[28]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[29]  Leonidas J. Guibas,et al.  Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..

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

[31]  C. Pandu Rangan,et al.  An O(n log n) algorithm for a maxmin location problem , 1992, Discret. Appl. Math..

[32]  G. O. Wesolowsky,et al.  A Maximin Location Problem with Maximum Distance Constraints , 1980 .

[33]  Robert E. Tarjan,et al.  Planar Point Location Using Persistent Search Trees a , 1989 .

[34]  Sergei Bespamyatnikh.  Packing two disks in a polygon , 2002 .

[35]  Prosenjit Bose,et al.  Packing two disks into a polygonal environment , 2004, J. Discrete Algorithms.

[36]  Michael Segal,et al.  Improved algorithms for placing undesirable facilities , 2002, CCCG.

[37]  Jack Brimberg,et al.  MULTI-FACILITY LOCATION USING A MAXIMIN CRITERION AND RECTANGULAR DISTANCES. , 1994 .