Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 581-592 |
| Number of pages | 12 |
| Journal | International Journal of Computational Geometry and Applications |
| Volume | 10 |
| Issue number | 6 |
| DOIs | |
| State | Published - 1 Jan 2000 |
Keywords
- Coverage queries
- Facility location optimization
- Piercing set
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics