Skip to main content
Breadcrumb

Algorithms, advanced course

Course
DIT281
Master’s level
7,5 credits (ECTS)

About

The course covers 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

Requirements

Successfully completed courses corresponding to 120 credits within the subject Computer Science or equivalent, including successful completion of DIT600 Algorithms, 7.5 credits (or equivalent). Applicants must prove their knowledge of English: English 6/English B from Swedish Upper Secondary School or the equivalent level of an internationally recognized test, for example TOEFL, IELTS.