Algorithm 2.

Algorithm for constructing a greedy randomized solution

1:  procedure    ConstructGreedyRandomizedSolution (G_expanded, Target)

2:   solution ← Set()

3:   α ← random(0, 1)

4:   candidates ← Construct_Initial_Candidates(G_expanded, Target)

5:   G(v)      ← Construct_Greedy_Functions(G_expanded, candidates)

6:   while candidates do

7:     RCL ← MakeRCL(candidates, G(v), α)

8:       s ← Select_Candidate(RCL)

9:       solution ← solution∪{s}

10:       if Target ⊂ LDOI(solution) then

11:         return solution

12:      end if

13:      Update_Candidates(candidates)

14:       end while

15:       return Set()

16: end procedure