The following gives a practical example:
Let's say for m = 4
:
// the sets for reuniting
Set1 = { 5 , 1 , 2 }
Set2 = { 2 , 6 , 3 }
Set3 = { 7 , 8 , 4 }
Set4 = { 4 , 9 , 10}
// the set I need to form
Set m+1: Set5 = { 1 , 2 , 3 , 4 }
I have to find a set of indexes e.g. A = { 1, 2, 3 }
so that U (Seti)
includes Set5
, where i
is part of A
. The cardinal of A
must be minimal.