Algorithms
1st Edition
0073523402
·
9780073523408
© 2008 | Published: September 13, 2006
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematica…
Read More
Request More Info
Receive via shipping:
- Colour, print bound version of the complete text
0 Prologue1 Algorithms with Numbers2 Divide-and-Conquer Algorithms3 Decompositions of Graphs4 Paths in Graphs5 Greedy algorithms6 Dynamic Programming7 Linear Programming and Reductions8 NP-complete Problems9 Coping
2 Divide-and-Conquer Algorithms3 Decompositions of Graphs4 Paths in Graphs5 Greedy algorithms6 Dynamic Programming7 Linear Programming and Reductions8 NP-complete Problems9 Coping
4 Paths in Graphs5 Greedy algorithms6 Dynamic Programming7 Linear Programming and Reductions8 NP-complete Problems9 Coping
6 Dynamic Programming7 Linear Programming and Reductions8 NP-complete Problems9 Coping
8 NP-complete Problems9 Coping
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical ide
Sprinkled with interesting stories about the development of important algorithms as well as about their current uses in the global information environment.
The book is concise and realistic; with key Design Issues and rationales that clearly outline the problems to be solveD and show how to develop the algorithm...
Self contained chapters that provide a variety of perspectives on the implementation of algorithms The authors cover THE essential algorithms that students need to know, but are also thorough and rigorous; including coverage of linear programming and quantum computing (BOTH optional, BUT COVERED IN NO OTHER BOOK).
The book uses a unique approach for proofs and is intuitive and accessible.