DeepRead
Cover of Algorithm design

About the book

A textbook for an undergraduate algorithms course, co-written by Jon Kleinberg and Eva Tardos and published in 2005. It covers the design and analysis of algorithms for problems in graphs, networks, sequencing, and optimization, including the topics of computational intractability and NP-completeness. The book holds that algorithm design is learned by starting from concrete problems and reasoning about how they are structured, not by memorizing a catalogue of algorithms. Its main claim is that a small set of recurring design principles, such as greedy methods, divide and conquer, dynamic programming, network flow, local search, and approximation, can be matched to a problem once it is defined precisely. It also treats proof of correctness and analysis of running time as part of the design process rather than an afterthought.

Written by Claude from what it knows of this book.

What Hacker News says 68% recommend · 2% critical

0510200720102015202020262008 peak · 6
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say 5.00 from 1 rating

  1. 51
  2. 40
  3. 30
  4. 20
  5. 10
  • 21 want to read
  • 0 reading
  • 3 have read

Only 1 rating: treat the average as a hint.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1922
ISBN
9780321295354
Editions known
6 at Open Library
Open Library
OL9166321W

005.1AlgorithmesAlgoritmenAlgoritmos e estruturas de dadosComputer algorithmsData structures (Computer science)DatastructurenQa76.9.a43 k54 2006Structures de donnees (Informatique)

Explore in the mosaic

Read next: its neighbours on the mosaic