# Approximation Algorithms

## Information

## Homework

Remember: You need to do at least 3/4 of the problems throughout the term.
- HW1. Due 2/20/03. Problems 2.1, 2.6, 2.11, 3.3, 3.6, 12.9, 12.10, 14.6, 15.3

HW2. Due 3/6/03. Write a proposal for your course project or lecture.
HW3. Due 4/3/03. Problems 9.2, 9.9, 16.3, 16.8, 26.4, 26.5, 26.9, 26.14. Also - Show that there is no 4/3-approximation for minimizing makespan on unrelated parallel machines unless P=NP. (For a real challenge, show that there is no 3/2-approximation.)
- Assume that you have a fractional matching in which each vertex is matched exactly. Give a polynomial-time algorithm to convert the fractional matching into a matching.

- HW4. Due 5/12/03. Problems 19.2, 19.3, 19.6, 20.3, 20.4, 24.6, 27.1
- HW 5. Course project is due on 5/12/03.

## Course Announcements

- Readings for Lecture 1 are available outside of 306 Mudd.