The course will describe and analyse a number of algorithms for combinatorial computational problems.
Algorithmic concepts: randomized algorithms, approximation algorithms, fixed-parameter algorithms.
Advanced course focusing on areas on the border between computer science and discrete mathematics and covering modern techniques for construction of efficient algorithms.
Choose semester and course offering to see current information and more about the course, such as course syllabus, study period, and application information.
KTH Campus
25%
50303
Normal Daytime
English
Places are not limited
Open for all programmes from year 3 and for all master's programmes, as long as it can be included in your programme.
Ioana-Oriana Bercea (bercea@kth.se)
Please note: all information from the Course syllabus is available on this page in an accessible format.
Course syllabus DD2440 (Autumn 2024–)The course will describe and analyse a number of algorithms for combinatorial computational problems.
Algorithmic concepts: randomized algorithms, approximation algorithms, fixed-parameter algorithms.
After passing the course, the student should be able to
in order to
If the course is discontinued, students may request to be examined during the following two academic years.
Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.
The examiner may apply another examination format when re-examining individual students.
ÖVN1 consists of group tasks and individual assignments that are reported in writing and a group project that is reported in writing and orally.
Please discuss with the instructor.
In this course, the EECS code of honor applies, see:
http://www.kth.se/en/eecs/utbildning/hederskodex