Next:
Introduction to Algorithms
Up:
The Algorithm Design Manual
Previous:
Contents
Techniques
Introduction to Algorithms
Correctness and Efficiency
Expressing Algorithms
Keeping Score
The Big Oh Notation
Growth Rates
Logarithms
Modeling the Problem
About the War Stories
War Story: Psychic Modeling
Exercises
Data Structures and Sorting
Fundamental Data Types
Specialized Data Structures
Sorting
Applications of Sorting
Approaches to Sorting
War Story: Stripping Triangulations
War Story: Mystery of the Pyramids
War Story: String 'em Up
Exercises
Breaking Problems Down
Dynamic Programming
Limitations of Dynamic Programming
War Story: Evolution of the Lobster
War Story: What's Past is Prolog
War Story: Text Compression for Bar Codes
Divide and Conquer
Exercises
Graph Algorithms
The Friendship Graph
Data Structures for Graphs
War Story: Getting the Graph
Traversing a Graph
Applications of Graph Traversal
Modeling Graph Problems
Minimum Spanning Trees
Shortest Paths
War Story: Nothing but Nets
War Story: Dialing for Documents
Exercises
Combinatorial Search and Heuristic Methods
Backtracking
Search Pruning
Bandwidth Minimization
War Story: Covering Chessboards
Heuristic Methods
War Story: Annealing Arrays
Parallel Algorithms
War Story: Going Nowhere Fast
Exercises
Intractable Problems and Approximations
Problems and Reductions
Simple Reductions
Satisfiability
Difficult Reductions
Other NP-Complete Problems
The Art of Proving Hardness
War Story: Hard Against the Clock
Approximation Algorithms
Exercises
How to Design Algorithms
Algorithms
Mon Jun 2 23:33:50 EDT 1997
