The.Algorithm.Design.Manual.Springer-Verlag.1998

A Catalog of Algorithmic Problems
For most if not all of the problems presented, we identify readily available software implementations,
which are discussed in the implementation field of each entry. Many of these routines are quite good,
and they can perhaps be plugged directly into your application. Others will be incomplete or inadequate
for production use, but they hopefully can provide a good model for your own implementation. In
general, the implementations are listed in order of descending usefulness, but we will explicitly
recommend the best one available for each problem if a clear winner exists. More detailed information
for many of these implementations appears in Chapter . Essentially all of the implementations are
available via the WWW site associated with this book, reachable at http://www.cs.sunysb.edu/
algorith.
Finally, in deliberately smaller print, we discuss the history of each problem and present results of
primarily theoretical interest. We have attempted to report the best results known for each problem and
point out empirical comparisons of algorithms if they exist. This should be of interest to students and
researchers, and also to practitioners for whom our recommended solutions prove inadequate and who
need to know if anything better is possible.
● Data Structures
❍ Dictionaries
❍ Priority Queues
❍ Suffix Trees and Arrays
❍ Graph Data Structures
❍ Set Data Structures
❍ Kd-Trees
● Numerical Problems
❍ Solving Linear Equations
❍ Bandwidth Reduction
❍ Matrix Multiplication
❍ Determinants and Permanents
❍ Constrained and Unconstrained Optimization
❍ Linear Programming
❍ Random Number Generation
❍ Factoring and Primality Testing
❍ Arbitrary-Precision Arithmetic
❍ Knapsack Problem
❍ Discrete Fourier Transform
● Combinatorial Problems
file:///E|/BOOK/BOOK3/NODE126.HTM (2 of 4) [19/1/2003 1:27:49]