#### Harsh Pranami

##### Padawan

**T is a cover of S if U T[SUB]k[/SUB]= U S[SUB]i[/SUB] , 1<=i<=m. A minimum cover of S is a cover of minimum size.**Consider the greedy strategy: build T by adding to T, at each stage of the iteration S[SUB]p[/SUB] from S, such that it adds largest number of elements from S, not already in T.Stop when UT[SUB]1[/SUB]= S[SUB]i[/SUB].

Can someone please explain this problem, especially the bold part?