Introduction To The Design And Analysis Of Algorithms: A Strategic Approach

by Lee

About the Book: Introduction to the Design and Analysis of Algorithms: A Strategic Approach This book presents algorithm design from the viewpoint of strategies. Each strategy is introduced with many algorithms designed under the strategy. Each algorithm is presented with many examples and each example with many figures. This book also discusses the concept of NP-completeness before introducing approximation algorithms Again, this is explained through examples which make sure that the students have a definite idea about this very abstract concept. This book can be used as a textbook by senior undergraduate students or master level graduate students in computer science. Contents Introduction The Complexity of Algorithms and the Lower Bounds of Problems The Greedy Method The Divide-and-Conquer Strategy Tree Searching Strategies Prune-and-Search Dynamic Programming The Theory of NP-Completeness Approximation Algorithms Amortized Analysis Randomized Algorithms On-Line Algorithms Bibliography About the Authors: RCT Lee, SS Tseng, RC Chang, YT Tsai R. C. T. Lee, National Chi Nan University, Taiwan S. S. Tseng, National Chiao Tung University, Taiwan R. C. Chang, National Chiao Tung University, Taiwan Y. T. Tsai, Providence University, Taiwan

752 pages, Paperback

First published May 1, 2006