Algorithm Design and Analysis

Undergraduate

covers advanced algorithm design techniques, including divide-and-conquer, greedy algorithms, dynamic programming and network flows. The emphasis is on algorithmic problem solving and algorithm design and analysis methodologies, rather than on specific algorithms. NP-completeness and methods for dealing with intractability will also be discussed.