Kenneth A. Berman

This is a companion volume to Algorithms: Foundations and Design Strategies by the same authors. Topics include Internet Algorithms, String Matching, Graph Connectivity, Matching and Network Flow Algorithms, Probabilistic Algorithms, Lower Bound Theory, Approximation Algorithms, AI Search Strategies and Genetic Algorithms.

The objectives of this book are to provide a solid foundation for the theory of algorithms. The book is intended to serve as a text for a core upper division undergraduate course in the design and analysis of algorithms.