Midterm
CSE 552 Fall 2013
Out 23 October electronically.
Due 28 October before 1:30 p.m. MST
Clarications, added 25 October
First, please look at the sample solutions for the homeworks before using your solution from one of
the homeworks in answering the
HOMEWORK 2 SOLUTIONS
CSE 552
RANDOMIZED AND APPROXIMATION ALGORITHMS
1. Question 1.
a) The larger the value of k is, the smaller the expected number of days until we get
all the coupons we need. In fact if n = k then the number of days we need to collect
HOMEWORK I SOLUTIONS
CSE 552
RANDOMIZED AND APPROXIMATION ALGORITHMS
1. Question 1.
a) Let G = (V, E ) be a multi-graph with no self loops. Partition the sequence of contractions
performed into epochs so that all contractions in an epoch except the last c
HOMEWORK III SOLUTIONS
CSE 552
RANDOMIZED AND APPROXIMATION ALGORITHMS
1. Question 1.
In a Steiner tree of a graph with metric distances, one can always bypass any
Steiner vertex of degree 2. If you do this, every Steiner point must have degree at
least t
Midterm Solutions
CSE 552 Fall 2013
Out 23 October electronically.
Due 28 October before 1:30 p.m. MST
Abbreviated solutions are given, with many details omitted.
Clarications, added 25 October
First, please look at the sample solutions for the homeworks