Set Cover Input: A set I={i1,i2,,in} of items and a set S={s1,s2,,sm} of subsets of I. Output: All minimum-size set covers of I, i.e., all smallest-possible size subsets S of S such that the union of all sets in S is equal to I. best solution found so far? An example item-subset set file iset1.txt is as follows: 54 1:2:1223 3: 45 4: 234