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: This course is not scheduled for the 2009-2010 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
- Prerequisites: COMP 362 or MATH 350 or permission of instructor. Strong background in algorithms and/or mathematics.