Question: Show that this problem below is NP-hard: (is it by reduction from independent set, vertex cover, or something else? I do not know.) Minimum Set
Show that this problem below is NP-hard: (is it by reduction from independent set, vertex cover, or something else? I do not know.)
Minimum Set Cover: Given n elements E = {e1,...,en} and m subsets of E, Si E, and integer k, determine if there is some k of the sets {Si} such that their union is E.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
