# Is finding the smallest collection of subsets so that the number of elements among the subsets is <= the number of subsets NP-hard?

Given a collection of non-empty subsets of $\{1,2,\ldots,N\}$ ($N$ not fixed), the problem is to find the smallest non-empty collection of subsets so that the number of distinct elements appearing among the union of subsets is less than or equal to the number of subsets chosen. This seems like an NP-hard problem but I can't prove it. Any help?

• What have you tried? Where did you get stuck? What's your rationale for believing this to be NP-hard. – ZeroUltimax Aug 22 '14 at 18:00
• @ZeroUltimax I thought about things like set-cover but that would mean finding the minimal number of strings so that all characters appear. I also tried to come up with a relationship to a clique problem but got stuck there too. The reason I believe this is NP-hard is that I've tried to come up with polynomial time algorithms and failed, and also someone posted a similar question on StackOverflow asking for a fast algorithm and all they got was brute force and a reduction to integer programming. – user2566092 Aug 22 '14 at 18:27
• It looks like this question doesn't have anything to do with strings. The order of the letters in each string is irrelevant, so you could treat this as a question about sets. I suggest you edit the question accordingly. What have you tried? Have you tried looking at a list of NP-complete problems that involve sets of sets? – D.W. Aug 24 '14 at 3:19
• @D.W. I modified the question to be about sets per your suggestion. Yes, I looked at questions regarding sets and cliques but got stuck. It looks like someone may have a solution involving clique, I'm still checking it out. – user2566092 Aug 25 '14 at 16:55

Let's re-formulate the problem setting slightly as a bipartite graph $G$, with $\{1,2,\ldots,N\} = X$ as one set of vertices and the collection of subsets (say, $Y$) as the other set of vertices, with an edge between $i \in X$ and $J \in Y$ iff $i \in J$. For any set of vertices $W$ in $Y$, define $N(W)$ to be the neighborhood of $W$ in $G$ -- namely, the set of all vertices in $X$ that are adjacent to at least one vertex in $W$.
Then, the problem asks to find a minimal subset $W \subseteq Y$ such that $|N(W)| \leq |W|$. However, if we change the criterion slightly to $|N(W)| \lt |W|$, we find that such a subset exists if and only if there does not exist a matching between $X$ and $Y$ that covers $Y$, for it is exactly equivalent to Hall's Marriage Theorem.
Since such matchings are findable in polynomial time (e.g.: via Hopcroft-Karp), I think this version of the problem should probably be relatively easy but I'd have to do some more work to figure out if and how the standard algorithms for bipartite matching expose these deficient sets and whether or not minimal deficient sets can also be obtained easily. Furthermore, I can't tell right away how much harder the original version of the problem (which allows $|N(W)| = |W|$) is than this modified version.