CS 162 - Algorithms Homework 7, 25 Points
Due: Second Lecture of WEEK 8, 10 minutes before class starts.
-
5 points.
Exercise 7.21 from Sipser.
-
5 points.
Problem 7.22 from Sipser.
-
5 points.
In the SET-COVER problem, we are
given a set of elements,
{1, 2, ..., m},
called the universe, and a set S of n sets whose
union equals the universe.
We are also given an integer, k, and asked if
there is a collection of k sets in S such that the union
of the sets in this collection equals the universe.
Show that SET-COVER is NP-complete.
-
5 points.
Problem 7.35 from Sipser.
-
5 points.
Problem 7.54 from Sipser.