Algorithm Design Takes A Fresh Approach To The Algorithms Course, Introducing Algorithmic Ideas Through The Real-world Problems That Motivate Them. In A Clear, Direct Style, Jon Kleinberg And Eva Tardos Teach Students To Analyze And Define Problems For Themselves, And From This To Recognize Which Design Principles Are Appropriate For A Given Situation. The Text Encourages A Greater Understanding Of The Algorithm Design Process And An Appreciation Of The Role Of Algorithms In The Broader Field Of Computer Science.--jacket. Introduction:...
Read the full description
Algorithm Design Takes A Fresh Approach To The Algorithms Course, Introducing Algorithmic Ideas Through The Real-world Problems That Motivate Them. In A Clear, Direct Style, Jon Kleinberg And Eva Tardos Teach Students To Analyze And Define Problems For Themselves, And From This To Recognize Which Design Principles Are Appropriate For A Given Situation. The Text Encourages A Greater Understanding Of The Algorithm Design Process And An Appreciation Of The Role Of Algorithms In The Broader Field Of Computer Science.--jacket. Introduction: Some Representative Problems -- Basics Of Algorithms 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 -- Epilogue: Algorithms That Run Forever. Jon Kleinberg, Éva Tardos. Includes Bibliographical References (p. [805]-814) And Index.
