Lecture 13

Learning objectives

After this class, you should be able to:

1. Prove that the primal-dual algorithm set cover yields a feasible solution, and determine its approximation factor.
2. Show how we can express the above algorithm as a purely combinatorial algorithm, without referring to linear programming.

Reading assignment

1. AA: Chapter 15.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 15.2: Remove the scaffolding of linear programming from algorithm 15.2, to obtain a purely combinatorial factor f algorithm for set cover.

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