Obnoxious Facility Location: Complete Service with Minimal Harm

We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. 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 e cient 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.

• Type: Journal
• Year: 2000
• Where: IJCGA
• Authors: Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
• Keywords: Cient Algorithms, Demand Site, IJCGA 2000, Obnoxious Facilities