Learning objectives

After this class, you should be able to:

1. Define the MAX-SAT problem.
2. Given an instance of MAX-SAT, show how you can formulate it as an integer linear program.
3. Explain the two basic randomized approximate algorithms for the above problem, and their respective derandomizations.
4. Prove the correctness of the above algorithms, and derive the approximation factors for them.
5. Explain the randomized a deterministic hybrid algorithms for this problem, and derive their approximation factors.

Reading assignment

1. AA: Chapter 16; VK: Introduction.
2. Prepare for the midterm.

Exercises and review questions

• Questions on current lecture's material
  1. Give an instance of MAX-SAT with at least four variables and at least four clauses, a give the integer linear program corresponding to this instance.
  2. Show that (1 - 1/k)k < 1/e, k > 1 .
  3. Explain the derivation in AA for the approximation factors of the hybrid algorithms.
• Questions on next lecture's material
  1. Prepare for the midterm.