Algorithm Design and Analysis

Catalog description

Techniques for the design and analysis of algorithms, including greedy algorithms, divide-and-conquer, and dynamic programming graph and network algorithms (shortest paths, connectivity, coloring, flows, matchings), geometric algorithms (convex hulls, range search, nearest neighbors), NP-complexity and lower and upper bounds of program complexity, approximation algorithms (vertex cover, traveling salesman, scheduling), and introduction to randomized algorithms.