Question: Problem 2. (30 score) Consider the following set covering problem, where we have 10 elements {1,2,,10}, and there are a bunch of 9 sets S1={1,2,3},S2={2,4,6},S3={9,10},S4={2,5,9},S5={2,6,8},

Problem 2. (30 score) Consider the following set covering problem, where we have 10 elements {1,2,,10}, and there are a bunch of 9 sets S1={1,2,3},S2={2,4,6},S3={9,10},S4={2,5,9},S5={2,6,8}, S6={4,5},S7={7,9},S8={3,7,10} and S9={1,8,9,10}. The set covering problem aims to choose the smallest number of sets that cover all the 10 elements. Please design a meaningful greedy heuristic method to solve this
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
