How to find the maximum cover with the minimum subgroup of vectors

Question

I am looking for an algorithm to find the minimum subgroup of vectors of MxN binary matrix with the maximum coverage. e.g given the next matrix it will return b and c

<