Research Article
Spider Covers and Their Applications
Algorithm 2
The algorithm for the Spider Cover Problem on
,
, and
.
Algorithm SP_COV | Set Family of groups that need to be covered | Set , | Repeat | (i) Compute the minimum integer (with ) such that the algorithm | MAX_SP outputs a spider in reaching a set for which | | (ii) From the spider in obtain (via Lemma 4) new spiders in that cover | at least elements of | (iii) Let be the new family of uncovered subsets, put in the new spiders, | set . | Until . | Output: and . |
|