Algorithm Question

[George Sakkis]

Gabriel Genellina wrote:

> This is known as a "set cover" algorithm. You have a set of subsets,
> and want to determine the smallest set of those subsets, whose union
> is the universal set - (uh, what a mess!)

I thought of that too, but he seems to be adding a second desired
property: the intersections of the subsets should be as small as
possible, or in other words the subsets should be as distinct as
possible.

George