COMP 554 Approximation Algorithms (4 credits)

Offered by: Computer Science (Faculty of Science)


Computer Science (Sci) : The theory and application of approximation algorithms. Topics include: randomized algorithms, network optimization, linear programming and semi definite programming techniques, the game theoretic method, the primal-dual method, and metric embeddings.

Terms: Winter 2017

Instructors: Frederick Shepherd (Winter)

  • Prerequisites: COMP 362 or MATH 350 or permission of instructor. Strong background in algorithms and/or mathematics.

  • Restriction: Not open to students who have taken COMP 692