Approximation strategy-proof mechanisms for obnoxious facility location on a line

2017 ◽  
Vol 36 (2) ◽  
pp. 549-571 ◽  
Author(s):  
Lili Mei ◽  
Deshi Ye ◽  
Yong Zhang
Keyword(s):  
Facility Location ◽  
Obnoxious Facility Location ◽  
Obnoxious Facility ◽  
Strategy Proof

OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM

2000 ◽  
Vol 10 (06) ◽  
pp. 581-592 ◽  
Author(s):  
BOAZ BEN-MOSHE ◽  
MATTHEW J. KATZ ◽  
MICHAEL SEGAL
Keyword(s):  
Data Structure ◽  
Facility Location ◽  
Efficient Solution ◽  
Location Problem ◽  
Facility Location Problem ◽  
Efficient Algorithms ◽  
Minimal Distance ◽  
Rectangular Region ◽  
Obnoxious Facility Location ◽  
Obnoxious Facility

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.

Sign in / Sign up

Export Citation Format

Share Document