|Website:||website containing additional information|
|Period:||period 3 (week 6 through 15, i.e., 8-2-2021 through 16-4-2021; retake week 27)|
|Participants:||up till now 40 subscriptions|
|Schedule:||Official schedule representation can be found in MyTimetable|
|Contents:||Systems and programs are designed for many purposes and in many ways, but it's algorithms that make things work. In this course, we study a number of advanced techniques for efficient algorithm design, often at the hand of problems from networks and graphs.
In many applications, networks and graphs are used as a model. Typical examples are networks of roads, or electronic networks. In other applications, the graph model may be less obvious, but appears to be very useful, like for scheduling problems. In this course, we look to the translation of problem to network model, and we look to algorithmic problems and their solutions on networks and graphs.
Some topics are: network flows, matchings, stable marriage and stable roommates problems, planar graphs, treewidth, graph isomorphism, exact exponential-time algorithms, approximation algorithms, fixed parameter tractability, kernelisation, randomised algorithms, and some complexity theory.
|Literature:||Most literature will be handed out during the course or can be downloaded from the website.
|Course form:||Lectures, two per week. Exercises. Lectures on Tuesdays will be in principal be given by Johan van Rooij and lectures on Thursdays will be in principal be given by Jesper Nederlof.|
|Exam form:||There are a number of exercise sets (6-8) and two exams.
In order to pass the course, you need:
|Minimum effort to qualify for 2nd chance exam:||To qualify for a 2nd chance exam, you need a final grade of at least 4.|