التفاصيل البيبلوغرافية
| العنوان: |
A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR OPTIMAL 1.5D TERRAIN GUARDING. |
| المؤلفون: |
Ben-Moshe, Boaz1 benmo@yosh.ac.il, Katz, Matthew J.2 matya@cs.bgu.ac.il, Mitchell, Joseph S. B.3 jsbm@ams.sunysb.edu |
| المصدر: |
SIAM Journal on Computing. 2007, Vol. 36 Issue 6, p1631-1647. 17p. 8 Diagrams. |
| مصطلحات موضوعية: |
*ALGORITHMS, GEOMETRIC modeling, POLYGONS, GEOMETRICAL constructions, MATHEMATICAL research |
| مستخلص: |
We present the first constant-factor approximation algorithm for a nontrivial instance of the optimal guarding (coverage) problem in polygons. In particular, we give an O(1)-approximation algorithm for placing the fewest point guards on a 1.5D terrain, so that every point of the terrain is seen by at least one guard. While polylogarithmic-factor approximations follow from set cover results, our new results exploit the geometric structure of terrains to obtain a substantially improved approximation algorithm. [ABSTRACT FROM AUTHOR] |
|
Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics 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 |
Full Text Finder