Design and analysis of computer algorithms

Abstract

This ebook introduces: mathematical background, review of sorting and selection, dynamic programming, greedy algorithms, graphs, depth-first search, topological sort and strong components, minimum spanning trees and kruskal's alogorithm, prim's and baruvka's algorithms for MSTs, Dijkstra's algorithm for shortest paths, all-pairs shortest paths, NP-completeness, cook's theorem, 3SAT, and Independent set, Clique, vertex cover, and dominating set, subset sum, approximation algorithms, the k-center approximation, approximations