|
|
|
Special Characteristics of the Book:
●This is a extremely easy to read book. Throughout the book, a large number of examples are given. Each concept and each algorithm are coupled with examples.
●This book gives a clear concept of lower bound.
●This book explains the theory of NP-completeness through examples. This makes sure that the students can have an intuitive feeling about the theory.
●This book has an entire chapter on tree searching techniques. Not only branch-and-bound is introduced as a tree searching technique, the A* algorithm, which is popular in artificial intelligence, is now incorporated into the field of algorithms.
●Many interesting examples are given in the chapter of prune and search .
●The PTAS (polynomial time approximation scheme) is introduced in Chapter 9, the chapter on approximation algorithm.
●A thorough and detailed discussion of amortized analysis is given in Chapter 10. Never has been amortized analysis discussed so much in detail.
●A rather interesting randomized algorithm example about an O(n) minimal spanning tree algorithm is given in Chapter 11.
●Among all presently available book, this is the only one having a chapter on On-line algorithm.
