in reply to Contemplating some set comparison tasks
This is the classical set covering problem, and it is NP-hard.