It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) . We will ...
Mathematical Background: We expect that the student is comfortable with basic mathematics at the level of a U.S. first-year college STEM student. This includes basic notions such as sets and functions ...
Advanced algorithms and complexity analysis. Dynamic programming; greedy algorithms; amortized analysis; shortest path and network flow graph algorithms; NP-completeness; approximation algorithms; ...
The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite ...