Worked solutions to all 236 end-of-chapter exercises in Algorithm Design by Jon Kleinberg and Éva Tardos — stable matching, asymptotic analysis, graph search, greedy algorithms, divide and conquer, dynamic programming, network flow, NP-completeness, PSPACE, fixed-parameter and approximation algorithms, local search, and randomized algorithms, each with an algorithm, a correctness proof and a running-time bound.
Éva Tardos
J. Kleinberg and É. Tardos, Algorithm Design, Addison-Wesley (Pearson),
- Algorithm design taught through problems: greedy algorithms, divide and
conquer, dynamic programming, network flow, NP-completeness, approximation, local search and randomized algorithms, each technique motivated by the problem it was invented to solve.
Worked solutions to all 236 end-of-chapter exercises live at Solutions to Kleinberg & Tardos’s Algorithm Design.