TABLE III.
Algorithm of Graph-assistanted Greedy Neighborhoods Cover
| Input: X, F, a, k, G Output: B |
|---|
| 1. Select arbitrary ℕi ∈ F |
| 2. B ← {ℕi} |
| 3. U ← X − ℕi |
| 4. while U ≠ Ø |
| 5. do B̃ = ∪ℕ∈B ℕ |
| 6. get L according to (19) |
| 7. Gsub = G (L, B̃) |
| 8. T = Gsub · e⃗ |
| 9. let imin denote the index of element which is the |
| minimum in T wich constraint: T(imin) ≥ a · k |
| 10. U ← X − ℕL{imin} |
| 11. B ← B ∪{ℕL{imin}} |
| 12. end while |