An Approach For Coping With The Apparent Intractability of Many Np-hard Problems Is to Look For The Best Approximate Solution, While Maintaining Polynomial Running Time. in This Course, The Basic Notions of Approximation Algorithms, Such As a Fully Polynomial Approximation Scheme, Are Reviewed. a Wide Variety Of Techniques For Approximating Problems in Combinatorial Optimization Are Discussed.

Faculty: Computer Science
|Undergraduate Studies |Graduate Studies

Pre-required courses

(234247 - Algorithms 1 and 236343 - Theory of Computation)

Semestrial Information