TY - JOUR
T1 - Obnoxious facility location
T2 - Complete service with minimal harm
AU - Ben-Moshe, Boaz
AU - Katz, Matthew J.
AU - Segal, Michael
PY - 2000/12
Y1 - 2000/12
N2 - 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.
AB - 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.
KW - Coverage queries
KW - Facility location optimization
KW - Piercing set
UR - http://www.scopus.com/inward/record.url?scp=0034556438&partnerID=8YFLogxK
U2 - 10.1142/S0218195900000322
DO - 10.1142/S0218195900000322
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0034556438
SN - 0218-1959
VL - 10
SP - 581
EP - 592
JO - International Journal of Computational Geometry and Applications
JF - International Journal of Computational Geometry and Applications
IS - 6
ER -