The Algorithm Design Manual

**....The most comprehensive guide to designing practical and efficient algorithms!....** **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** 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. **NEW** to the second edition: • **Doubles the tutorial material and exercises** over the first edition • Provides **full online support** for lecturers, and a **completely updated and improved** website component with lecture slides, audio and video • Contains a **unique catalog** identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them • Includes several **NEW** "war stories" relating experiences from **real-world applications** **•** Provides up-to-date links leading to the very best algorithm __**implementations**__ available in C, C++, and Java **ADDITIONAL** Learning Tools: • Exercises include "job interview problems" from major software companies • Highlighted take-home lesson boxes emphasize essential concepts • Provides comprehensive references to both survey articles and the primary literature • Exercises point to relevant programming contest challenge problems • Many algorithms presented with actual code (written in C) as well as pseudo-code • A full set of lecture slides and additional material available at www.algorist.com Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of __**The Algorithm Design Manual**__ is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, __**Programming Challenges: The Programming Contest Training Manual**__. This Expanded And Updated Second Edition Of A Classic Bestseller Continues To Take The Mystery Out Of Designing And Analyzing Algorithms And Their Efficacy And Efficiency. Expanding On The Highly Successful Formula Of The First Edition, The Book Now Serves As The Primary Textbook Of Choice For Any Algorithm Design Course While Maintaining Its Status As The Premier Practical Reference Guide To Algorithms. New: (1) Incorporates Twice The Tutorial Material And Exercises. (2) Provides Full Online Support For Lecturers, And A Completely Updated And Improved Website Component With Lecture Slides, Audio And Video. (3) Contains A Highly Unique Catalog Of The 75 Most Important Algorithmic Problems. (4) Includes New War Stories And Interview Problems, Relating Experiences From Real-world Applications. Unique, Handy Reference Package With A Practical, Hands-on Appeal To A Wide Audience This Classic Bestseller Has Been Expanded And Updated With Twice The Original Tutorial Material And Exercises Contains A Highly Unique Catalog Of The 75 Most Important Algorithmic Problems Additional Useful Information Such As Lecture Slides And Updates Available Via Author's Website. I. Practical Algorithm Design. Introduction To Algorithm Design -- Algorithm Analysis -- Data Structures -- Sorting And Searching -- Graph Traversal -- Weighted Graph Algorithms -- Combinatorial Search And Heuristic Methods -- Dynamic Programming -- Intractable Problems And Approximations -- How To Design Algorithms -- Ii. The Hitchhiker's Guide To Algorithms. A Catalog Of Algorithmic Problems -- Data Structures -- Numerical Problems -- Combinatorial Problems -- Graph Problems: Polynomial-time -- Graph Problems: Hard Problems -- Computational Geometry -- Set And String Problems -- Algorithmic Resources. Steven S. Skiena. Previous Ed.: 1997. Includes Bibliographical References (p. [665]-707) And Index. Most professional programmers that I’ve encountered are not well prepared to tackle algorithm design problems. This is a pity, because the techniques of algorithm design form one of the core practical technologies of computer science. Designing correct, efficient, and implementable algorithms for real-world problems requires access to two distinct bodies of knowledge: • Techniques – Good algorithm designers understand several fundamental algorithm design techniques, including data structures, dynamic programming, depth first search, backtracking, and heuristics. Perhaps the single most important design technique is modeling, the art of abstracting a messy real-world application into a clean problem suitable for algorithmic attack. • Resources – Good algorithm designers stand on the shoulders of giants. Rather than laboring from scratch to produce a new algorithm for every task, they can figure out what is known about a particular problem. Rather than re-implementing popular algorithms from scratch, they seek existing implementations to serve as a starting point. They are familiar with many classic algorithmic problems, which provide sufficient source material to model most any application. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both students and computer professionals. Most professional programmers that I’ve encountered are not well prepared to tacklealgorithmdesignproblems.Thisisapity,becausethetechniquesofalgorithm design form one of the core practical technologies of computer science. Designing correct, e?cient, and implementable algorithms for real-world problems requires access to two distinct bodies of knowledge: • Techniques – Good algorithm designers understand several fundamental - gorithm design techniques, including data structures, dynamic programming, depth-?rst search, backtracking, and heuristics. Perhaps the single most - portantdesigntechniqueismodeling,theartofabstractingamessyreal-world application into a clean problem suitable for algorithmic attack. • Resources – Good algorithm designers stand on the shoulders of giants. Ratherthanlaboringfromscratchtoproduceanewalgorithmforeverytask, they can ?gure out what is known about a particular problem. Rather than re-implementing popular algorithms from scratch, they seek existing imp- mentations to serve as a starting point. They are familiar with many classic algorithmic problems, which provide su?cient source material to model most any application. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both students and computer professionals. 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 This expanded and updated second edition of a classic bestseller continues to take the mystery out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. This new edition: (1) Incorporates twice the tutorial material and exercises; (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video; (3) Contains a highly unique catalog of the 75 most important algorithmic problems; (4) Includes new war stories and interview problems, relating experiences from real-world applications--Back cover Unique, handy reference package with a practical, hands-on appeal to a wide audience The new edition of this classic bestseller has been expanded and updated with twice the original tutorial material and exercises Contains a highly unique catalog of the 75 most important algorithmic problems Additional useful information such as lecture slides and updates available via author's website