Boaz Ben-Moshe, Matthew J. Katz, and Michael Segal. Obnoxious facility location: Complete service with minimal harm. International Journal of Computational Geometry and Applications, pages 581-- 592, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Packing Two Disks into a Polygonal Environment - Bose, Morin, Vigneron (2001) (Correct)
....algorithm. For simple polygons (i.e. polygons without holes) Bespamyatnikh [4] gives an O(n log n) time algorithm based on the parametric search paradigm [11] Another special case occurs when the holes of P degenerate to points. This is known as the maximin 2 site facility location problem [3,9]. In this formulation we can think of the centers of the two disks as obnoxious facilities such as smokestacks, or nuclear power plants, and the points as population centers. The goal is maximize the distance between each facility and the nearest population center. Katz et al. 9] give an O(n log ....
Boaz Ben-Moshe, Matthew J. Katz, and Michael Segal. Obnoxious facility location: Complete service with minimal harm. In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), pages 76-79, 1999.
Packing Two Disks into a Polygonal Environment - Bose, Morin, Vigneron (Correct)
....algorithm. For simple polygons (i.e. polygons without holes) Bespamyatnikh [4] gives an O(n log n) time algorithm based on the parametric search paradigm [11] Another special case occurs when the holes of P degenerate to points. This is known as the maximin 2 site facility location problem [3, 9]. In this formulation we can think of the centers of the two disks as obnoxious facilities such as smokestacks, or nuclear power plants, and the points as population centers. The goal is maximize the distance between each facility and the nearest population center. Katz et al. 9] give an O(n log ....
Boaz Ben-Moshe, Matthew J. Katz, and Michael Segal. Obnoxious facility location: Complete service with minimal harm. International Journal of Computational Geometry and Applications, 10:581--592, 2000.
Packing Two Disks into a Polygonal Environment - Bose, Morin, Antoine (2001) (Correct)
....holes, Biedl et al. 5] give an O(n 2 ) time algorithm and Bespamyatnikh [4] gives an O(n log 3 n) time algorithm based on the parametric search paradigm [11] Another special case occurs when the holes of P degenerate to points. This is known as the maximin 2 site facility location problem [3, 9]. In this formulation we can think of the centers of the two disks as obnoxious facilities such as smokestacks, or nuclear power plants, and the points as population centers. The goal is maximize the distance between each facility This research was supported by the Natural Sciences and Engineering ....
Boaz Ben-Moshe, Matthew J. Katz, and Michael Segal. Obnoxious facility location: Complete service with minimal harm. In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), pages 76--79, 1999.
Packing Two Disks into a Polygonal Environment - Bose, Morin (Correct)
No context found.
Boaz Ben-Moshe, Matthew J. Katz, and Michael Segal. Obnoxious facility location: Complete service with minimal harm. International Journal of Computational Geometry and Applications, pages 581-- 592, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC