Obnoxious facility location: Complete service with minimal harm

We present efficient algorithms for several instances of the following facility location problem. Place k obnoxious facilities, with respect to n given demand sites and m given regions, where the goal is to maximize the minimal distance between a demand site and a facility, under the constraint that each of the regions must contain at least one facility. We also present an efficient solution to the following planar problem that arises as a subproblem. Given n transmitters, each of range r, construct a compact data structure that supports coverage queries, i.e., determine whether a query polygonal/rectangular region is fully covered by the transmitters.

[1]  Jirí Matousek,et al.  Ray Shooting and Parametric Search , 1993, SIAM J. Comput..

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

[3]  David Eppstein,et al.  Faster construction of planar two-centers , 1997, SODA '97.

[4]  Michael Segal,et al.  Constrained Square-Center Problems , 1998, SWAT.

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

[6]  Stefan Arnborg,et al.  Proceedings of the 6th Scandinavian Workshop on Algorithm Theory , 1998 .

[7]  Matthew J. Katz,et al.  Optimal Line Bipartitions of Point Sets , 1999, Int. J. Comput. Geom. Appl..

[8]  Michael Segal.  On Piercing Sets of Axis-Parallel Rectangles and Rings , 1997, ESA.

[9]  Micha Sharir,et al.  Rectilinear and polygonal p-piercing and p-center problems , 1996, SCG '96.

[10]  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).

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

[12]  Doron Nussbaum,et al.  Rectilinear p-piercing problems , 1997, ISSAC.

[13]  Sergey Bereg,et al.  Optimal Facility Location under Various Distance Functions , 1999, WADS.

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

[15]  Micha Sharir.  A Near-Linear Algorithm for the Planar 2-Center Problem , 1997, Discret. Comput. Geom..

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

[17]  Bernard Chazelle,et al.  Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[18]  Matthew J. Katz,et al.  Optimal Line Bipartitions of Point Sets , 1996, ISAAC.

[19]  Donald B. Johnson,et al.  Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..