Computer Algorithm Design and Analysis

Author: Wang Xiaodong
Publisher:
Publish Date: 2004-07-01
Features: This book is a core textbook for the algorithm design and analysis course in computer science programs at universities. The entire book organizes knowledge units around algorithm design strategies, systematically introducing methods and techniques for algorithm design and analysis. The main content includes: an overview of algorithms, recursion and the divide-and-conquer strategy, dynamic programming, greedy algorithms, backtracking, branch and bound, probabilistic algorithms, linear programming and network flows, NP-completeness theory and approximation algorithms, etc. The book covers both classic and practical algorithms with case studies, as well as tracking hot topics in the field of algorithms. To enhance readability and usability, learning objectives are added at the beginning of each chapter, and exercises suitable for different difficulty levels are provided at the end of each chapter. Additionally, free electronic lecture slides and other teaching resources (including hints for solving exercises and arrangements for hands-on experiments) are available. Instructors can obtain these resources as specified in the preface.