Oh My Learning

Algorithm Design (Kleinberg and Tardos)

12 lessons · 0/12 discussed · baseline mid

01 Stable matching and algorithmic reasoning 8 min read mid drafted 02 Asymptotic analysis and recurrence solving 9 min read mid drafted 03 Divide and conquer with proof of correctness 9 min read mid drafted 04 Greedy algorithms and exchange arguments 8 min read mid drafted 05 Dynamic programming: optimal substructure and state design 9 min read mid drafted 06 Shortest paths and negative cycles 9 min read mid drafted 07 Graph traversal, connectivity, and strongly connected components 10 min read mid drafted 08 Maximum flow and minimum cut 9 min read senior drafted 09 Reductions and NP-completeness proofs 9 min read senior drafted 10 Coping with NP-hardness: approximation algorithms 9 min read senior drafted 11 Coping with NP-hardness: local search and heuristic design 9 min read senior drafted 12 Intractability in practice: modeling choices and tractable relaxations 9 min read senior drafted