التفاصيل البيبلوغرافية
| العنوان: |
Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem |
| المؤلفون: |
Ben-Moshe, Boaz1 benmoshe@cs.bgu.ac.il, Carmi, Paz1 carmip@cs.bgu.ac.il, Katz, Matthew J. matya@cs.bgu.ac.il |
| المصدر: |
Information Processing Letters. Feb2004, Vol. 89 Issue 3, p137. 3p. |
| مصطلحات موضوعية: |
*ALGORITHMS, *MATHEMATICAL analysis, COMPUTATIONAL complexity |
| مستخلص: |
We observe that Matousˇek's algorithm for computing all dominances for a set P of n points in Rn can be employed for computing all pairs of points in such a set whose sum is greater or equal to a given point a∈Rn. We apply this observation to the decision problem of the discrete planar two-watchtower problem and obtain an improved solution. [Copyright &y& Elsevier] |
|
Copyright of Information Processing Letters is the property of Elsevier B.V. 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 |
