The Online Set Cover Problem 1: A Deterministic O(log m log n)-Competitive Algorithm for Unweighted Online Set CoverResearch Paper
Set cover asks for the fewest sets from a family of subsets of a ground set of elements whose union contains . It is NP-hard, and the best ratio achievable in polynomial time is (Feige 1998, doi:10.1145/285055.285059).