Lecture 15

Learning objectives

After this class, you should be able to:

1. Explain the approximation algorithms that combine the two earlier derandomized algorithms for the MAX-SAT problem.
2. Derive approximation factors for these algorithms.

Reading assignment

1. Chapter 16.
2. Prepare for the midterm.

Exercises and review questions

• Questions on current lecture's material
  1. Prove the expected approximation factor of 3/4 for algorithm 5.

• Questions on next lecture's material
  1. Prepare for the midterm.