APPROXIMATION ALGORITHMS

CSE 597A           Fall 2009
  • Instructor: Martin Fürer
  • Email: furer@cse.psu.edu
  • Room: 333 IST
  • Time: TW 4:15 - 5:30
  • Title: Approximation Algorithms
  • Credits: 3
  • Short Description: Classification of NP-hard optimization problems according to their approximability in polynomial time. Approximation algorithms are studied together with proofs of their approximation ratio.
  • Introduction to Contents of this Course
  • Course Announcement
  • Textbook: Approximation Algorithms by Vijay V. Vazirani
  • A compendium of NP optimization problems
  • More books
  • Special Location:
  • Wednesday, October 7:   212 Hammond
  • Tuesday, October 13:      223B IST
  • Wednesday, October 14:  2 Deike
    •