Design and Analysis of Algorithms

3 credits · Graduate School

Set manipulation techniques, divide-and-conquer methods, the greedy method, dynamic programming, algorithms on graphs, backtracking, branch-and-bound, lower bound theory, NP-hard and NP-complete problems, approximation algorithms. SPRING. [3]