Bookmark and Share

These lecture notes are intended for use with the textbook Algorithm Design by Jon Kleinberg and Éva Tardos. The slides were created by Kevin Wayne and are distributed by Pearson Addison-Wesley.
If you are an instructor using the textbook and would like the most up-to-date version of the ppt files, please email me.

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. In a clear, straight-forward style, Kleinberg and Tardos teaches students to analyze and define problems for themselves and from this, to recognize which design principles are appropriate for a given situation. The text encourages a greater understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Cover Image


Stable matching1Propose-and-reject
Algorithm analysis2
Graphs3Topological order
Greedy algorithms4.1 - 4.4Interval scheduling  ·  Dijkstra
Minimum spanning tree4.5 - 4.7
Huffman codes †4.8
Divide-and-conquer5.1 - 5.4Merge  ·  Merge and invert
Multiplication5.5 - 5.6
Dynamic programming6.1 - 6.7
Bellman-Ford6.8 - 6.10
Max flow, min cut7.1 - 7.3Ford-Fulkerson
Network flow applications7.5 - 7.12
Assignment problem7.13
Intractability8.1 - 8.2
Poly-time reductions8.5 - 8.8, 8.10The Longest Path   [mp3]
NP-completeness8.3 - 8.4, 8.9
Extending limits of tractability10
Approximation algorithms11List scheduling
Local search12
Randomized algorithms13

Our Followers

Speak to us !

Creative Commons License [Valid RSS] [Valid Atom 1.0] Trust Seal