Obnoxious facility location: Complete service with minimal harm

International Journal of Computational Geometry and Applications

Volumn 10, Issue 6, 2000, Pages 581-592

  Ben Moshe, Boaz ^a   Katz, Matthew J ^a   Segal, Michael ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Coverage queries; Facility location optimization; Piercing set

Indexed keywords

EID: 0034556438     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000322     Document Type: Article

References (20)

1. P.K. Agarwal and J. Matoušek "Ray shooting and parametric search" SIAM J. Computing 22 (1993), 794-806.
2. M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf Computational Geometry: Algorithms and Applications, Springer-Verlag, Berlin, 1997.
3. S. Bespamyatnikh, K. Kedem and M. Segal "Optimal facility location under various distance functions" in Proc. Workshop on Algorithms and Data Structures, pp. 318-329, 1999.
4. B. Bhattacharya and H. Elgindy "An efficient algorithm for an intersection problem and an application" Tech. Report 86-25, Dept. of Comp. and Inform. Sci., University of Pennsylvania, 1986.
5. J. Brimberg and A. Mehrez "Multi-facility location using a maximin criterion and rectangular distances" Location Science 2 (1994), 11-19.
6. B. Chazelle "Filtering search: a new approach to query-answering" SIAM J. Computing 15 (1986), 703-724.
7. O. Devillers and M.J. Katz "Optimal line bipartitions of point sets" Internat. J. Comput. Geom. Appl. 9 (1999), 39-51.
8. F. Follert, E. Schömer and J. Sellen "Subquadratic algorithms for the weighted maximin facility location problem" in Proc. 7th Canad. Conf. Comput. Geom., pp. 1-6, 1995.
9. G.N. Frederickson and D.B. Johnson "Generalized selection and ranking: sorted matrices" SIAM J. Computing 13 (1984), 14-30.
10. M.J. Katz, K. Kedem and M. Segal "Discrete rectilinear 2-center problems" Comput. Geom. Theory Appl., to appear.
11. M.J. Katz, K. Kedem and M. Segal "Improved algorithms for placing undesirable facilities" in Proc. 11th Canad. Conf. Comput. Geom., pp. 65-67, 1999.
12. Y. Konforty and A. Tamir "The single facility location problem with minimum distance constraints" Location Science 5 (1997), 147-163.
13. D.T. Lee and Y.F. Wu "Geometric complexity of some location problems", Algorithmica 1 (1986), 193-211.
14. J. Matoušek "Efficient partition trees" Discrete Comput. Geom. 8 (1992), 315-334.
15. N. Megiddo "Applying parallel computation algorithms in the design of serial algorithms" Journal of ACM 30 (1983), 852-865.
16. N. Megiddo and A. Tamir "New results on the complexity of p-center problems" SIAM J. Comput. 12(4) (1983), 751-758.
17. D. Nussbaum "Rectilinear p-Piercing Problems" in Proc. 1997 International Symposium on Symbolic and Algebraic Computation, pp. 316-323, 1997.
18. M. Segal "On the piercing of axis-parallel rectangles and rings" in Proc. 5th European Symp. on Algorithms, Lecture Notes in Computer Science 1284, pp. 430-442, 1997.
19. M. Sharir "A near-linear algorithm for the planar 2-center problem" Discrete Comput. Geom. 18 (1997), 125-134.
20. M. Sharir and E. Welzl "Rectilinear and polygonal p-piercing and p-center problems" in Proc. 12th ACM Symp. on Computational Geometry, pp. 122-132, 1996.