Uw huidige browser heeft updates nodig. Zolang u niet update zullen bepaalde functionaliteiten op de website niet beschikbaar zijn.
Let op: het geselecteerde rooster heeft overlappende bijeenkomsten.
Volgens onze gegevens heb je nog geen vakken behaald.
Je planning is nog niet opgeslagen
Let op! Uw planning heeft vakken in dezelfde periode met overlappend timeslot
Advanced Algorithms (2026/2027: Periode 3)
Cursusdoel
After completing this course, the student will have:
- knowledge of important combinatorial algorithms and advanced algorithmic techniques;
- the ability to model problems from applications mathematically (e.g., as graph problems);
- the ability to apply algorithmic techniques to solve these problems;
- the ability to design combinatorial algorithms;
- the ability to prove correctness of algorithms;
- the ability to analyze the running time of complex algorithms.
- have an overview of various algorithmic research directions in theoretical computer science
- the ability to work with continuous models of computation and prove lower bounds in this regime
Assessment
There are a number (approximately 14) of exercises, and two exams.
- The exercises contribute 20% of the final grade. Students get points for submission during the tutorial and participation in peer-feedback.
- The midterm and final exams each count for 40% of the final grade. Approximately 30% of each exam consists of open pool questions, the rest consist of surprise questions. The open pool questions are given to students before the exam.
In order to pass the course, you need:
- an average grade of at least 5.5.
- an average of at least 5.0 for the exams.
To qualify for a repair of the final result the mark needs to be at least a 4, or “AANV”.
Vakinhoudelijk
This course explores advanced techniques for efficient algorithm design, with a focus on combinatorial problems. Networks (graphs) are used as a primary theoretical model for both practical applications and theoretical study. Topics include classical combinatorial problems such as packing, covering, knapsack, subset sum, and scheduling problems.
The course is divided into two parts:
- Part 1: Fundamental algorithms with practical and theoretical importance, including (stable) matchings, advanced algorithms for maximum flow/minimum cut, minimum cost flows, Euler tours, planar graphs.
- Part 2: Broader algorithmic topics, including fixed-parameter tractability, treewidth, exact exponential-time algorithms, approximation algorithms, and the existential theory of the reals.
Lectures and tutorials. Each lecture is accompanied by homework exercises (which may be part of the open exam pool. Students have one week to complete the homework.
Werkvormen
Toetsing
Eindresultaat
Verplicht | Weging 100% | ECTS 7,5
Ingangseisen en voorkennis
Ingangseisen
Je moet een geldige toelatingsbeschikking hebben
Voorkennis
Participants are expected to have a solid background in mathematics and algorithmic concepts, including familiarity with basic algorithmic paradigms and the theory of NP-completeness.
Voertalen
- Engels
Cursusmomenten
Tentamens
Er is geen tentamenrooster beschikbaar voor deze cursus
Verplicht materiaal
Er is geen informatie over de verplichte literatuur bekend
Aanbevolen materiaal
-
WNBMost literature will be handed out during the course.<br> Recommended books for further reading will be indicated but are not required.
Coördinator
| dr. T. Miltzow | t.miltzow@uu.nl |
Docenten
| dr. T. Miltzow | t.miltzow@uu.nl |
| dr. J.M.M. van Rooij | J.M.M.vanRooij@uu.nl |
Inschrijving
Inschrijving
Van maandag 2 november 2026 tot en met vrijdag 20 november 2026
Na-inschrijving
Van maandag 18 januari 2027 tot en met maandag 22 februari 2027
Inschrijving niet geopend
Permanente link naar de cursuspagina
Laat in de Cursus-Catalogus zien
Laat in MyTimetable zien
klikt, stop je een vak in je rugzak, zodat je dit vak door de rest van de CursusPlanner mee kunt nemen.