The algorithm design manual

Steven S. Skiena (auth.)9781848000698, 1848000693, 9781848000704

….The most comprehensive guide to designing practical and efficient algorithms!….
This newly expanded and updated second edition of the best-selling classic continues to take the «mystery» out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.
The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.
The Algorithm Design Manual, Second Edition
«…the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject.» –ACM Computing Reviews
«It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources.» — P. Takis Metaxas, Wellesley College
«This is the most approachable book on algorithms I have.» — Megan Squire, Elon University, USA

---

Table of contents :
Front Matter….Pages I-XVI
Front Matter….Pages 1-1
Introduction to Algorithm Design….Pages 3-30
Algorithm Analysis….Pages 31-64
Data Structures….Pages 65-102
Sorting and Searching….Pages 103-144
Graph Traversal….Pages 145-190
Weighted Graph Algorithms….Pages 191-229
Combinatorial Search and Heuristic Methods….Pages 230-272
Dynamic Programming….Pages 273-315
Intractable Problems and Approximation Algorithms….Pages 316-355
How to Design Algorithms….Pages 356-360
Front Matter….Pages 361-361
A Catalog of Algorithmic Problems….Pages 363-365
Data Structures….Pages 366-392
Numerical Problems….Pages 393-433
Combinatorial Problems….Pages 434-474
Graph Problems: Polynomial-Time….Pages 475-522
Graph Problems: Hard Problems….Pages 523-561
Computational Geometry….Pages 562-619
Set and String Problems….Pages 620-656
Algorithmic Resources….Pages 657-664
Back Matter….Pages 665-730