Alsuwaiyel M.H. Algorithms: Design Techniques and Analysis

Dhahran: King Fahd University of Petroleum & Minerals, 1998. - 430p.The field of computer algorithms has flourished since the early 1960's when the 1rst users of electronic computers started to pay attention to the performance of programs. The limited resources of computers at that time resulted in additional impetus for devising efficient computer algorithms.
After extensive research in this field, numerous e±cient algorithms for different problems emerged. The similarities among dierent algorithms for certain classes of problems have resulted in general algorithm design techniques.
This book emphasizes most of these algorithm design techniques that have proved their utility in the solution to many problems. It may be considered as an attempt to cover the most common techniques in the design of sequential algorithms. Each technique is presented as follows.
First, the context in which that technique can be applied. Second, the special characteristics of that technique that set it apart. Third, comparison with other techniques, whenever possible; finally, and most importantly, illustration of the technique by applying it to several problems.Basic Concepts and Introduction to AlgorithmsBasic Concepts in Algorithmic Analysis
Mathematical Preliminaries
Data Structures
Heaps and the Disjoint Sets Data StructuresTechniques Based on RecursionInduction
Divide and Conquer
Dynamic ProgrammingFirst-Cut TechniquesThe Greedy Approach
Graph TraversalComplexity of ProblemsNP-complete Problems
Introduction to Computational Complexity
Lower BoundsCoping with HardnessBacktracking
Randomized Algorithms
Approximation AlgorithmsIterative Improvement for Domain-Specific ProblemsNetwork Flow
MatchingTechniques in Computational GeometryGeometric Sweeping
Voronoi Diagrams