Pearson Education, Inc., 2005. - 857 p.
Introduction : Some representative problems.
Basics of Algorithm Analysis.
Graphs.
Greedy Algorithms.
Divide and Conquer.
Dynamic Programming.
Network Flow.
NP and Computational Intractability.
PSPACE: A Class of problems beyond NP.
Extending the Limits of Tractability.
Approximation Algorithms.
Local Search.
Randomized Algorithms.