- J. van Leeuwen. email j.vanleeuwen@cs.uu.nl, tel. 030-2534001, CGN kamer A309.
- M. veldhorst. email marinus@cs.uu.nl, tel. 030-2534450, CGN kamer A310.

- Lecture hours:
- Monday: 15.00-17.00 in: BBL-416.
- Thursday: 9.00-11.00 in : BBL-416.
- For the masterstudents: a third timeslot during weeks 3-8 (see here).

- First meeting: Monday January 6th, 15.00-17.00.
- Final exam (tentamen): Monday Februari 24th, 14.00-17.00, in EDUC-ALFA.
- Here is the week-schedule.
- Further schedule for MSc students.
- Useful links

Order the book

#### Lectures

For errata to the

*first*and*second*editions of the book, see the homepage of the book.

#### Homework/Studies

For every lecture the material that needs to be studied is listed in the weekly werkschedule: study the material both in advance (globally) and afterwards (in detail). All further assignments are listed in the weekly schedule as well.

#### Research-assignment

- For 3rd year students: paper.
- For masterstudents: (joint) research group or seminar.

#### Final exam

Final exam (tentamen): Monday, 24 Februari 2003, 14.00-17.00, in EDUC-ALFA.Here are some old exams (in Dutch), based on a previous version of the course

*and partly based on another textbook.*The old exams are NOT necessarily representative as to contents.

For masterstudents: the working group/seminar part will count for 40%, the participation (in the working group) for 10%, and the exam will count for 50% of the final grade.

- scientific information links of the Center for Algorithmic Systems.
- and the useful links below.

- Giorgio Ausiello et al.'s book on `Complexity and Approximation'
- Dorit Hochbaum's book on `Approximation Algorithms for NP-hard Problems'
- Vijay Vazirani's book on `Approximation Algorithms'
- Crescenzi-Kann compendium on NPO problems and their status wrt approximability
- Motwani's lecture notes on Approximation algorithms (1992)
- Goemans' lecture notes on `Approximation Algorithms' (1994)
- Goemans' lecture notes on the `Euclidean TSP Approximation Scheme' (1996)
- Karpinski's lecture notes over `Randomisierte
und approximative Algoritmen f\"ur harte

Berechnungsprobleme' (1998) - Williamson's lecture notes on Approximation Algorithms (Spring 1998)
- Williamson's lecture notes on Approximation Algorithms (Fall 1998)
- Williamson's course on "Approximation algorithms" at MIT (Spring 2000)
- Sudan's course on "Approximability of Optimization Problems - A complexity-theoretic view of combinatorial optimization" (1999).
- Arora's lectures on the PCP theorem (1996)
- Shmoys' survey over `Computing near-optimal solutions to combinatorial optimization problems' (1997)
- Seminar on `Approximation algorithms' by L. Cowen (JHU, 1998)
- Course on approximation algorithms (Zwick, 1999).
- Cheriyan en Ravi's lecture notes on `Approximation Algorithms for Network Problems'

- The Center for Algorithmic Systems.
- The MSc programme `Algorithmic Systems'.
- Projecten en stages: (MSc/afstudeer)projects with the AS-group, and `algemene mogelijkheden'.

*Last modified*: December 2002