Lecture 5

Learning objectives

After this class, you should be able to:

1. Modify the pseudo-polynomial time algorithm for Knapsack, to create a FPTAS.
2. Analyze the accuracy of the above algorithm.
3. Given a similar problem, develop a pseudo-polynomial time algorithm, and modify it to create an FPTAS.

Reading assignment

1. AA: Section 8.2.
2. CLR: Chapter 29, page 772 and 773.

Exercises and review questions

• Questions on current lecture's material
  1. Find an approximate solution to the knapsack example given in the previous class, using the FPTAS discussed in class, with epsilon = 0.75.

• Questions on next lecture's material
  1. (Post your answer on the discussion board) Give an example of a linear program with four variables and three equations, and give a feasible solution for it.