COP 4531: Lecture 25

Learning objectives

After this class, you should be able to:

1. Explain the following terms: approximation ratio, polynomial time approximation scheme, and fully polynomial time approximation scheme.
2. Explain the approximation algorithm for vertex cover and prove its approximation ratio.
3. Give an approximation algorithm, prove its approximation ratio.
4. Give an approximation algorithm and an approximation ratio claimed for it, give a counter-example to show that the approximation ratio is not correct.

Reading assignment

1. CLR: Chaper 35, up to (and including) section 35.1.
2. A compendium of NP optimization problems, www.nada.kth.se/~viggo/problemlist/compendium.html.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 35.1-3.

• Questions on next lecture's material
  1. None.