Algorithm:

- Greedy approach
- Grab the set covering the largest number of uncovered members

Greedy-Set-Cover(X, F)

U = X
; uncovered

C = {}

while U {}

select S F maximizing

U = U - S

C = C {S}

return C

**Corollary 35.5**

Greedy-Set-Cover has a ratio bound of (lnX + 1).

Proof in book.