Algorithms illuminated part 3 : Greedy algorithms and dynamic programming - Tim Roughgarden

Tim Roughgarden

ISBN 10: 0999282948 / ISBN 13: 9780999282946

Published by 2019, 2019

About this Item

Occasion - Bon Etat - Algorithms illuminated part 3 : Greedy algorithms and dynamic programming (2019) - Grand Format.

Seller Inventory # 3634553

Bibliographic Details

• Title: Algorithms illuminated part 3 : Greedy algorithms and dynamic programming - Tim Roughgarden
• Publisher: 2019
• Publication Date: 2019
• Language: English
• ISBN 10: 0999282948
• ISBN 13: 9780999282946
• Binding: Soft cover
• Condition: Used: Good
• Seller catalogs:
  • Grand Format
  • Grand Format Pages: Mathématiques

About this title

Synopsis

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).

Review

From Amazon.com (by Vladimir):

Yet another golden nugget from professor Roughgarden. Outstanding self-learning material for those who learn algorithms for the first time or for those who revisit the subject for rock-solid fundamental knowledge. Clear explanations for most popular greedy and dynamic programming algorithms. Throughout my experience interviewing CS graduates when working in the product development industry and back in times when I was a university lecturer, I found that for most students dynamic programming is one of the weakest areas among algorithm design paradigms. This book has outstanding, clear, easy to understand coverage for this topic.