Algorithms, advanced course - University of Gothenburg Till startsida
To content Read more about how we use cookies on

Algorithms, advanced course

Master's level | 7.5 credits | Course code: DIT281
Autumn 2020
50% Day
Period: 2 November 2020 - 17 January 2021
2) Only EU/EEA citizens and students with approved residence permit in Sweden can apply

About the Course

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.

More Information

Show more

Course Syllabus


Requirements 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.

Selection: Selection is based upon the number of credits from previous university studies, maximum 225 credits.

Tuition Fee

Application fee: 900 SEK
Full course cost: 17 875 SEK
First payment: 17 875 SEK

EU/EEA citizens, Swedish residence permit holders and exchange students do not pay fees. More information on:

Study Guidance




Department of Computer Science and Engineering
41296 Göteborg

Visiting address: Rännvägen 6 B

Page Manager: Jörgen Ölund
Last update: 2/18/2020 2:41 PM

Tell a friend about this page
Print version

Page Manager: Jörgen Ölund|Last update: 10/16/2018

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?

Denna text är utskriven från följande webbsida:
Utskriftsdatum: 2020-08-11