I’ll write in this blog some notes with the intention to better grasp what I consider the main points of the book titled Algorithm Design written by Jon Kleinberg and Éva Tardos [1].
I won’t necessarily follow the sequence of topics in the book nor do I intend to be comprehensive with respect to those topics.
My notes won't be self-contained. They will assume that you have access to the book, and hence will make reference to its content.
<hr />
Footnotes
<ol>
<li>Kleinberg, J., &amp; Tardos, É. (2006). Algorithm design. Addison-Wesley</li>
</ol>

I’ll write in this blog some notes with the intention to better grasp what I consider the main points of the book titled Algorithm Design written by Jon Kleinberg and Éva Tardos [1].

I won’t necessarily follow the sequence of topics in the book nor do I intend to be comprehensive with respect to those topics.

My notes won't be self-contained. They will assume that you have access to the book, and hence will make reference to its content.

---
**Footnotes**

1. Kleinberg, J., & Tardos, É. (2006). Algorithm design. Addison-Wesley

A description of what this blog is about.

About this blog