Figure 8From: The maximum clique enumeration problem: algorithms, applications, and implementationsThe Subset Cover Problem. The decision version of the subset cover problem asks if there are k or fewer subsets that cover all other subsets. A satisfying solution for k = 4 is the highlighted subsets.Back to article page