Course development and history
Advanced course focusing on areas on the border between computer science and discrete mathematics and covering modern techniques for construction of efficient algorithms.
Select the semester and course offering above to get information from the correct course syllabus and course offering.
The course will describe and analyze 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
No information inserted
Algorithms and complexity corresponding to one of the courses DD1352, DD2350, DD2352.
5B1204/SF1631 Discrete Mathematics and one of the courses 2D1352/DD1352 Algorithms, Data Structures, and Complexity and 2D1354/DD2354 Algorithms and Complexity or the equivalent.
Will be announced at least 4 weeks before the start of the course on the course web.
A, B, C, D, E, FX, F
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.
In this course, the code of honor of the school is applied, see: http://www.kth.se/en/csc/utbildning/hederskodex
Danupon Na Nongkai
Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.
Computer Science and Engineering, Information Technology, Information and Communication Technology
Please discuss with the instructor.
Danupon Na Nongkai (firstname.lastname@example.org)
In this course, the EECS code of honor applies, see:http://www.kth.se/en/eecs/utbildning/hederskodex