COMP 554. Approximation Algorithms.
Credits: 4
Offered by: Computer Science (Faculty of Science)
This course is not offered this catalogue year.
Description
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.
- 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