Approximation Algorithms (Unipg)

Schedule

  • Tuesday May 7th, from 15:00 to 17:00, Room B3
  • Wednesday May 8th, from 9:00 to 11:00, Room C2
  • Wednesday May 15th, from 9:00 to 11:00, Room C2
  • Wednesday May 15th, from 14:00 to 16:00, Room I2
  • Wednesday May 22nd, from 9:00 to 11:00, Room "Verde"
  • Wednesday May 22nd, from 16:00 to 18:00, Room I2

Lecture Notes

Seminars

Lectures by date

Textbooks

Most of the course is based on [1]

  • [1] The Design of Approximation Algorithms
    David P. Williamson and David B. Shmoys
    Cambridge University Press, 2011.
  • [2] G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi
    Complexity And Approximation
    Combinatorial Optimization Problems And Their Approximability Properties
    Springer, 1999.
  • [3] V. Vazirani
    Approximation Algorithms
    Springer, 2003.
  • [4] Approximation Algorithms for NP-Hard Problems
    Dorit S. Hochbaum
    PWS Publishing Company, 1995.