Homework 3

Find an instance of weighted vertex cover problem which is “bad” for the algorithm if you are greed at W(v)/D(v).
How bad could it be?

Due: April 7th.

Homework 1 & Homework 2 are also due on April 7th.