Course content.


  • Computational complexity
  • Approximation algorithms
  • (F)PTAS
  • Online algorithms

Algorithmic approaches

  • Exact solutions and approximation algorithms for computationally hard problems
  • Online algorithms and competitive analysis

Current stuff.

  • •There is a nice overview on proof techniques, all with a common example, from Estie Arkin available [here].
  • •Welcome to the class!
  • •The first seminar of the course will take place on December 13, 9:30-13:15 on zoom.

Mailing list.

Information will be made available via the mailinglist, contact to be added to the list.

Homework and Lectures.

  • The current homework sets can be found here.
  • Slides/notes can be downloaded from this site - Slides are password protected!
  • The password will be announced in the first seminar.


The course is self-contained, that is, the lecture notes and other course material will be enough to follow the course. For the group presentation material will be made available. Interested students may use the following books for additional self-study:
  • •Vijay V. Vazirani: Approximation Algorithms
  • • Michael R. Garey , David S. Johnson: Computers and Intractability
  • •Borodin, El-Yaniv: Online Computation and Competitive Analysis