The Algorithm Design Manual: TextThis volume helps take some of the "mystery" out of identifying and dealing with key algorithms. Drawing heavily on the author's own realworld experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which includes a catalog of the 75 most important algorithmic problems. By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. This book is ideal for the working professional who uses algorithms on a daily basis and has need for a handy reference. This work can also readily be used in an upperdivision course or as a student reference guide.THE ALGORITHM DESIGN MANUAL comes with a CDROM that contains:* a complete hypertext version of the full printed book.* the source code and URLs for all cited implementations.* over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to online lecture notes. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

Excellent book for studying algorithms
User Review  asfhuvx  Overstock.comExcellent book if youre looking to keep in touch with what you studied in college. Not as big and bulky as the CLR but it still contains most of the important algorithms and design techniques. Good reference book to carry around. Read full review
Good material Index sucks
User Review  buynewtextbookcom  Overstock.comI recently bought the second edition in order to do some personal research and as such did not plan on reading the book from covertocover. I intend to use the book as a reference and therefore utilize ... Read full review
Contents
Introduction to Algorithms  3 
Data Structures and Sorting  27 
Breaking Problems Down  53 
Graph Algorithms  81 
Combinatorial Search and Heuristic Methods  115 
Intractable Problems and Approximations  139 
Other editions  View all
Common terms and phrases
algorithm design applications array backtracking binary search catalog characters clause clique coloring combinatorial compute connected components constraints construct contains convex hull cost data structures defined deletion depthfirst search dictionary discussed in Section dynamic programming edge efficient algorithm elements example expositions faster Figure Fortran function geometric given graph G Hamiltonian cycle hard heuristic implementations independent set Input description INPUT OUTPUT insertion integer integer partitions intersection isomorphism kdtrees LEDA linear programming lineartime longest matrix maximum minimize minimum spanning tree Netlib network flow node NPcomplete optimal pair partition performance permutations pixels planar graph polygon possible priority queue Problem description provides query random number reduction Related Problems search trees sequence set cover shortest path simulated annealing smallest solution solve subgraph subsets substring suffix tree topological sort tour triangle undirected graph vertex cover vertices Voronoi diagrams weight worstcase