1 Introduction: Some Representative Problems   2 Basics of Algorithms Analysis   3 Graphs   4 Divide and Conquer  5 Greedy Algorithms 6 Dynamic Programming   7 Network Flow   8 NP and Computational Intractability   9 PSPACE: A Class of Problems Beyond NP 10 Extending the Limits of Tractability   11 Approximation Algorithms    12 Randomized Algorithms   13 Local Search   Epilogue: Algorithms that Run Forever  References Index