Computer Algorithm Design and Analysis - (2nd Edition)

Author: Wang Xiaodong
Publisher:
Publish Date: 2006-05-01
Features: This book is a core course textbook for algorithm design and analysis in computer science programs at universities. It organizes the content around algorithm design strategies as knowledge units, systematically introducing methods and techniques for algorithm design and analysis. The main topics include: 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, key learning points are provided at the beginning of each chapter, and exercises of varying difficulty are included at the end. Free electronic lecture slides and other teaching resources (including hints for solving exercises and arrangements for computer experiments) are also provided. Instructors can obtain these materials as specified in the preface.