التفاصيل البيبلوغرافية
| العنوان: |
Obnoxious Facility Location: Complete Service with Minimal Harm. |
| المؤلفون: |
Ben-Moshe, Boaz, Katz, Matthew J., Segal, Michael, Mitchell, J. S. B. |
| المصدر: |
International Journal of Computational Geometry & Applications. Dec2000, Vol. 10 Issue 6, p581. 12p. |
| مصطلحات موضوعية: |
*ALGORITHMS, PLANE geometry |
| مستخلص: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Computational Geometry & Applications is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Business Source Index |
