This preview shows page 1. Sign up to view the full content.
CS 473: Algorithms, Fall 2010
HW 10 (due Thursday, December 2)
This homework contains four problems.
Read the instructions for submitting homework on
the course webpage
. In particular,
make sure
that you write the solutions for the problems on
separate sheets of paper; the sheets for each problem should be stapled together. Write your name
and netid on each sheet.
Collaboration Policy:
For this home work, Problems 13 can be worked in groups of up to 3
students each.
Problem 0 should be answered in Compass as part of the assessment HW10Online
and should be done individually.
0. (10 pts) HW10Online on Compass.
1. (25 pts) Let
G
= (
V,E
) be an undirected graph. A subset
S
⊆
V
of nodes in
G
is called a
covering set
if for all
v
∈
V
,
v
∈
S
or there is some node
u
∈
S
such that
{
u,v
} ∈
E
. In other
words every node in
V
\
S
is connected by an edge to some node in
S
. The decision version of
the minimum covering set problem is the following: Given a graph
G
and an integer
k
, does
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 01/22/2011 for the course CS 473 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.
 Fall '08
 Chekuri,C
 Algorithms

Click to edit the document details