Important announcement

Dear visitor,

Please note that this OpenCourseWare platform will be replaced at the end of 2026 by a new platform (under the same url ocw.tudelft.nl).

Courses and their contents that are currently available the platform will partly be migrated. URL’s for this content will change and content might be unavailable for some time. In addition, some courses will not be available anymore.

If you are linking to specific courses on this platform (for instance for your students), please take timely measures to avoid problems with access. Possible actions are:

Download the materials to your local platform (laptop, server)
For educators only (including TU Delft lecturers): Contact us at ocw@tudelft.nl and inform us what course you are using in what context (institute, program, period of use, number of students). We will research (in collaboration with the authors of the course) and decide if we will migrate the course, and if yes, can supply you with a new url.

Thank you.

Home Courses Algoritmiek Course materials Readings Readings Algoritmiek

Readings Algoritmiek

Course week(s) Week 5 Week 6 Week 7 Week 1 Week 2 Week 3 Week 4
Course subject(s) 01. Introduction Algoritmiek 02. Graphs 03. Greedy algorithms 04. Divide and conquer 05. Dynamic programming 06. Network flow Readings

This course is based on Chapter 1 to 7 from “Algorithm Design” by Jon Kleinberg and Éva Tardos:

Jon Kleinberg & Éva Tardos, “Algorithm Design”, Pearson/Addison-Wesley, 2005, ISBN: 0321295358

This course assumes you’ve had at least one course where some proving techniques were discussed. Such prerequisite knowledge is summarized in the following Guide for Making Proofs:

Proofs

Algoritmiek by TU Delft OpenCourseWare is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Based on a work at https://ocw.tudelft.nl/courses/algoritmiek/.

[sg_popup id=6]