
- Home
- Books
- Algorithms & Data Structures
- Core Algorithms
- Algorithm Design
Algorithm Design by Jon Kleinberg, Éva Tardos develops algorithm-design techniques through problems, proofs and applications. The text connects a problem's structure with methods such as greedy design and dynamic programming. Worked examples show how to establish correctness and analyze cost, encouraging readers to look for a reusable line of reasoning when they meet a problem that initially appears unfamiliar.
What you will learn
- Design greedy and dynamic-programming algorithms
- Prove correctness and analyze running time
- Use reductions and complexity concepts to compare problems
Who this is for
Computer science students taking an algorithms course. Data structures and discrete mathematics are expected.


