Design and Analysis of Algorithms

Catalog description

This course covers at least four major algorithm design techniques: greedy, divide-and-conquer, dynamic programming and network flow algorithms while emphasizing techniques for analyzing algorithms. Designing and analyzing algorithms for parallel machines will also be discussed. Additional topics include computational complexity focusing on NP-completeness, and some algorithmic techniques for dealing with intractable problems including approximation algorithms and local search.