Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming

I've read many books on this subject, after having 5 years of advance courses in the area. Back when, Targan, Aho, and Knuth's books were the only ones to follow. P-NP was getting formalized, and some of us were working on constrained Graph problems to make most any NP complete problems to P problems, after restricting some parameters.Tarjan's book was too precise, but a sure gem. Aho's book was a compulsory, often going thru too much abstraction. Knuth's books are just to know deep level of analysis and lot of background history - A reference sets of books.This series strike the right balance in terms of Abstraction, Analysis, and Presentation. Looks like lot of good parts of lectures are embedded into the text. Makes it lucid, coherent, concise, and concrete.My idea of Algorithm --- Throw a new problem at audience. Let them solve. Do they have enough arsenals? Do they have a way to analyze the hardness ( or softness ) of the problem. Can they map to a known or similar problem? ...After all these, see the approaches to the problem.This book have many of these, and anyone can gain long lasting knowledge about some of the fundamental areas of computing.Waiting for the 4th vol...Thanks for coming up with such a collection.

I am doing a PhD in Machine Learning and found this series Amazing! The exposition of the topics is soo smooth. Manages to convey complex topics in very understandable way. I have the whole series.

Sigue siendo un fantástico libro, y un imprescindible junto a los demás libros de Algorithms Illuminated.No obstante, este se me ha hecho un poco más duro: los greedy algorithms son muy fáciles de entender pero a menudo difíciles de demostrar. También el concepto de Dynamic Programming, al que se dedica medio libro, es suficientemente extenso y complejo como para necesitar varios tochos más...

Useless

Prof. Roughgarden is my all-time favorite instructor. His style is clear, concise, humorous, and direct to the essence of algorithms, 5 minutes can make clear what my instructor failed to for a semester. Prof. Roughgarden has impacted me on three levels. First, he made the algorithm knowledge clear and I may owe my future job to him. Second, he ignited my passion for algorithm, math, and general computer science, the journey is so fun guided by a charming master. The third level inspiration was his direct-to-the-essence minimalist philosophy, things get simple after you know the essence and only in this way can you hold more. Thank you so much Prof. Roughgarden and Merry Christmas!!!