Algorithms, advanced course
About
This course will be covering the following topics:
- approximation algorithms and approximation schemes for NP-complete problems, and their analysis,- use of linear programming, in particular for approximation,
- network flow with some complex applications,
- randomized algorithms and their analysis by appropriate random variables,
- helpful input structures like tree structures and input parameters.
Prerequisites and selection
Entry requirements
The requirement for the course is to have successfully completed courses corresponding to 120 creditswithin the subject Computer Science or equivalent, including successful completion of DIT093 Algorithms, 7.5 credits(or equivalent).
Applicants must prove knowledge of English: English 6/English B or the equivalent level of an internationally recognized test, for example TOEFL, IELTS.
Selection
Selection is based upon the number of credits from previous university studies, maximum 165 credits.
