OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM-Reference-Cited by-同舟云学术

OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM

Published:2000-12 Issue:06 Volume:10 Page:581-592
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

BEN-MOSHE BOAZ¹,KATZ MATTHEW J.¹,SEGAL MICHAEL²

Affiliation:

1. Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel

2. Department of Computer Science, University of British Columbia, Vancouver, B.C. Canada V6T 1Z4, Canada

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218195900000322

Reference15 articles.

1. Ray Shooting and Parametric Search

2. Optimal Facility Location under Various Distance Functions

3. Filtering Search: A New Approach to Query-Answering

4. OPTIMAL LINE BIPARTITIONS OF POINT SETS

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dispersing Obnoxious Facilities on a Graph;Algorithmica;2021-02-26

2. Efficient Approximations for the Online Dispersion Problem;SIAM Journal on Computing;2019-01

3. Economic Issues in Hazmat Transportation;Security Aspects of Uni- and Multimodal Hazmat Transportation Systems;2012-03-30

4. Obnoxious Centers in Graphs;SIAM Journal on Discrete Mathematics;2010-01

5. Maximizing the number of obnoxious facilities to locate within a bounded region;Computers & Operations Research;2010-01