Design and Analysis of Computer Algorithms (PDF 135P)

Design and Analysis of Computer Algorithms (PDF 135P)

This lecture note discusses the approaches to designing optimization algorithms, including dynamic programming and greedy algorithms, graph algorithms, minimum spanning trees, shortest paths, and network flows. Also it briefly discusses algorithmic problems arising from geometric settings, that is, computational geometry.

Author(s): David M. Mount

135 Pages