|Website:||website containing additional information|
|Period:||period 2 (week 46 through 5, i.e., 14-11-2016 through 3-2-2017; retake week 16)
|Participants:||up till now 49 subscriptions|
|Schedule:||Official schedule representation can be found in Osiris|
|Teachers:||Dit is een oud rooster!
|week: 51||Tue 19-12-2017||9.00-11.00 uur||room: EDUC-GAMMA|
|week: 5||Thu 1-2-2018||13.30-16.30 uur||room: EDUC-MEGARON|
|week: 16||Thu 19-4-2018||13.30-16.30 uur||room: BBG-219||retake exam|
|Contents:||Systems and programs are designed for many purposes and in many ways, but it's algorithms that make things work. Good algorithm design requires understanding and modelling an application, and subsequently studying and analyzing the computational features of the design. 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: shortest paths, flow, matchings, stable marriage and stable roommates problems, planar graphs, triangulated graphs, treewidth, graph isomorphism, exact exponential-time algorithms, approximation algorithms, fixed parameter tractability, kernelization, and some complexity theory.|
|Literature:||Most literature will be handed out during the course or can be downloaded from the website.
Note that these books are not obligatory. Participation in classes is recommended: much is not covered in the books!
- Cormen, Leiserson, Rivest, Stein. Introduction to Algorithms, Third Edition. MIT Press / McGraw-Hill, 2001. ISBN 978-0-262-03384-8.
- Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh. Parameterized Algorithms. Springer, 2015. ISBN 978-3-319-21274-6.
- Fomin and Kratsch. Exact Exponential Algorithms. Springer, 2010. ISBN 978-3-642-16532-0.
- Kleinberg and Tardos. Algorithm Design. Pearson / Addision Wesley, 2005. ISBN 978-0-321-29535-4.
- Schrijver. Combinatorial Optimization. Polyhedra and Efficiency. Springer, 2003. ISBN 978-3-540-44389-6.
|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 Hans Bodlaender.
|Exam form:||There are a number (7 - 8) exercise sets, and two exams.
In order to pass the course, you need:
The exercise sets count for 30 percent of the end note, and the two exams each for 35 percent.
- An average grade of at least 5.5 (computation of the average is explained above).
- At least an average grade of 6.0 on the exercises.
- An average of at least 5.0 for the exams.
|Minimum effort to qualify for 2nd chance exam:||Re-examn: if you have a 4.0 or more for the average, but no sufficient final grade, you can do a re-exam (additional testing). You can also do a re-exam, if you have at least a 5.5 for one of the exams and at least a 6.0 for the average of the exercise sets.
In case of insufficient grade for the exercise: If your average grade is at least 5.2 and the average of your exams is at least 4.8, then you can do instead of a re-exam, an extra written task (aanvullende toets). If you pass this task, then you obtain a 6.0 for the course. |