Algorithm SetCoverApprox(S):

Input: A collection S of sets S1, S2,...,Sm whose union is U

Output: A small set cover C for S

C // The set cover built so far

E // The elements from U currently covered by C

while E = U do

select a set Si that has the maximum number of uncovered elements

add Si to C

E E Si

Return C.

Describe the details of an efficient implementation of Algorithm and analyze its running time.