The Algorithm Design Manual, Second Edition
- 14h 21m
- Steven S. Skiena
- Springer
- 2012
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.
In this Book
-
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 Approximation Algorithms
-
How to Design 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
SHOW MORE
FREE ACCESS
