Name
Title | ||
|---|---|---|
Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem |
Abstract | ||
|---|---|---|
We observe that Matousek'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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.ipl.2003.07.008 | Inf. Process. Lett. |
Keywords | DocType | Volume |
computational geometry,decision problem,facility location.,improved solution,n point,set P,algorithms,large sums-of-pairs,discrete planar two-watchtower problem | Journal | 89 |
Issue | ISSN | Citations |
3 | 0020-0190 | 3 |
PageRank | References | Authors |
0.44 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Boaz Ben-moshe | 1 | 262 | 27.33 |
| Paz Carmi | 2 | 321 | 43.14 |
| Matthew J. Katz | 3 | 225 | 19.92 |