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:
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/.