2005 AlgorithmDesign

Revision as of 02:36, 24 June 2021 by Gmelli (talk | contribs) (Text replacement - "==Notes==" to "== Notes ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Subject Headings: Algorithm Design Task, Dynamic Programming, Randomized Algorithm.

Notes

Cited By

Quotes

Book Overview

  • Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. In a clear, straight-forward style, Kleinberg and Tardos teaches 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.

Preface

Chapter 1: Introduction: Some Representative Problems

Chapter 6: Dynamic Programming

Chapter 13: Randomized Algorithms

References


,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2005 AlgorithmDesignJon Kleinberg
Éva Tardos
Algorithm Designhttp://www.aw-bc.com/info/kleinberg/