OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
From MaRDI portal
Publication:2708039
DOI10.1142/S0218195900000322zbMath0970.68178MaRDI QIDQ2708039
Michael Segal, Boaz Ben-Moshe, Matthew J. Katz
Publication date: 17 April 2001
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Continuous location (90B85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (9)
Packing two disks in a polygon ⋮ Packing two disks into a polygonal environment. ⋮ Improved algorithms for placing undesirable facilities ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Locating an obnoxious plane ⋮ Dispersing obnoxious facilities on a graph ⋮ Maximizing the number of obnoxious facilities to locate within a bounded region ⋮ Computing obnoxious 1-corner polygonal chains ⋮ Locating two obnoxious facilities using the weighted maximin criterion
Cites Work
- Geometric complexity of some location problems
- Efficient partition trees
- A near-linear algorithm for the planar 2-center problem
- Ray Shooting and Parametric Search
- Generalized Selection and Ranking: Sorted Matrices
- New Results on the Complexity of p-Centre Problems
- Filtering Search: A New Approach to Query-Answering
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- The single facility location problem with minimum distance constraints
- OPTIMAL LINE BIPARTITIONS OF POINT SETS
This page was built for publication: OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
