This entry justifies some of the assumptions behind the algorithm devised at the prior entry "Within 50 km, revisited".

Let C be a finite set of 2D points called cities, and r > 0. The r-coverage problem for C, abbreviated Cov(C,r), consists of finding a set of nodes N and an associated tree T spanning those nodes with the following properties:

- For every c in C there is some n in N such that dist(c,n) ≤ r (coverage property).
- The length of T is minimum.

It is easy to see that for any solution (N,T) to Cov(C,r) the tree T is the Steiner tree of N, ST(N), so we need only concentrate on finding the set of nodes N. We now prove that, under certain conditions, we can restrict our search for solutions to Cov(C,r) to nodes lying in the r-circles centered at the cities of C.

Definition. A set of cities C is r-separable if for any c in C there is some c' in C such that dist(c,c') ≥ 2r.

Theorem. Let us index the set of cities C as c_{1},...,c_{m}, and let M = {{n_{1},...,n_{m}} : n_{i} in D(*c _{i}*,r)}, where

*D*(c

_{i},r) is the circle of radius r centered at the point c

_{i}. If C is r-separable, there is a solution (D,ST(D)) to Cov(C,r) such that D belongs to M.

Proof of theorem. Let (N,ST(N)) be a solution to Cov(C,r). From the r-separability of C, ST(N) must intersect each circle *D*(*c*_{i},*r*) at some point d_{i}; now, if we take (D,ST(D)), where D = {d_{1},..,d_{m}}, it is easy to see that

- D satisfies the coverage property,
- by our prior lemma, length(ST(D)) cannot be greater than length(ST(N)),

so (D,ST(D)) is a solution to Cov(C,r).

## No comments :

## Post a Comment