Admission requirements
Algorithms, Complexity, Datastructures (all at bachelor’s level).
Description
In this seminar we will discuss recent topics concerning algorithms; this year we discuss approximation algorithms. Students present chapters from the literature, and write detailed papers (in LaTeX) explaining their lectures.
Course objectives
Students should learn to read, understand, discuss and disseminate (in written and oral form) scientific papers.
Timetable
The most recent timetable can be found at the LIACS website
Mode of instruction
Lectures
Assessment method
The final grade is determined by the presentations, active participation, and two papers.
Reading list
D.P. Williamson and D.B. Shmoys, The design of approximation algorithms, Cambridge University Press, 2011
Registration
You have to sign up for classes and examinations (including resits) in uSis. Check this link for more information and activity codes.
There is a limited capacity for students from outside the master Computer Science programme. Please contact the study-advisor.
Contact information
Study coordinator Computer Science, Riet Derogee