COMP 554 Approximation Algorithms (4 credits)

Note: This is the 2016–2017 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.

Offered by: Computer Science (Faculty of Science)

Overview

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