Algorithm Design Techniques and Analysis

Author: [Saudi Arabia] M·H·Al
Publisher:
Publish Date: 2004-08-01
Features: The book is divided into seven parts and 19 chapters, starting with the basic concepts and methods of algorithm design and analysis. It subsequently introduces techniques such as recursion, divide and conquer, dynamic programming, greedy algorithms, and graph traversal, providing a fundamental yet clear discussion of NP-complete problems. It also covers the basic content of rapidly developing fields in recent years, such as probabilistic algorithms, approximation algorithms, and computational geometry, to a certain extent. Each chapter includes a large number of exercises to help readers understand and apply the content. This book is part of the "Lecture Notes Series on Computing" edited by the internationally renowned algorithm expert Professor De-Cai Li. It covers most general techniques in algorithm design, explaining the application background of each technique, highlighting its characteristics through comparisons with other techniques, and providing numerous practical examples. The book also emphasizes detailed complexity analysis of each algorithm. The book is divided into seven parts and 19 chapters, starting with the basic concepts and methods of algorithm design and analysis, subsequently introducing techniques such as recursion, divide and conquer, dynamic programming, greedy algorithms, and graph traversal, providing a fundamental yet clear discussion of NP-complete problems. It also covers the basic content of rapidly developing fields in recent years, such as probabilistic algorithms, approximation algorithms, and computational geometry, to a certain extent. Each chapter includes a large number of exercises to help readers understand and apply the content. The book is concise in structure and rich in content, making it suitable as a textbook and reference book for algorithm courses in computer science and related disciplines, especially for algorithm courses after completing data structures and discrete mathematics courses. It can also serve as a good introductory book for those engaged in algorithm research.