(Solved) : 171 Question Iii 15 Points 8 3 4 Points Greedy Algorithms 1 Consider Np Complete Problem S Q33115878 . . .
171 Question III (15 points; (8, 3), 4 points): Greedy Algorithms 1) Consider the NP-Complete problem Set-Cover, where the optimization version is defined as follows: Input: Output:The minimum number of sets S.,,S, A collection of m sets, S1, S2, …, Sm S,,1 < k s m, such that 2 Us, Us a) Develop a greedy algorithm that runs in polynomial time which attempts to solve this problem b) Is your algorithm correct? If yes, prove it. If no, give a counter example. Show transcribed image text
Expert Answer
Answer to 171 Question Iii 15 Points 8 3 4 Points Greedy Algorithms 1 Consider Np Complete Problem S Q33115878 . . .
OR