SubjectsSubjects(version: 845)
Course, academic year 2019/2020
   Login via CAS
Seminar on Approximation and Online Algorithms - NTIN072
Title in English: Seminář z aproximačních a online algoritmů
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2017
Semester: both
E-Credits: 3
Hours per week, examination: 0/2 C [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: English, Czech
Teaching methods: full-time
Additional information:
Note: you can enroll for the course repeatedly
you can enroll for the course in winter and in summer semester
Guarantor: prof. RNDr. Jiří Sgall, DrSc.
doc. Mgr. Petr Kolman, Ph.D.
Andreas Emil Feldmann, Dr.
Class: Informatika Mgr. - volitelný
Classification: Informatics > Theoretical Computer Science
Annotation -
Last update: prof. RNDr. Jiří Sgall, DrSc. (24.08.2004)
Seminar on selected topics from the theory of algorithms. Recent papers and results of the participants are presented.
Aim of the course -
Last update: prof. RNDr. Jiří Sgall, DrSc. (11.10.2017)

To gain an overview of current papers and interesting results in theory of algorithms.

Course completion requirements -
Last update: prof. RNDr. Jiří Sgall, DrSc. (06.10.2017)

To pass, a student needs to present a selected paper and participate actively during the semester.

Due to the requirements, additional attempts to pass are excluded.

Literature -
Last update: prof. RNDr. Jiří Sgall, DrSc. (11.10.2017)

Current conference papers

Syllabus -
Last update: SGALL/MFF.CUNI.CZ (07.04.2008)

Recent topics include:

  • Approximation and online algorithms for scheduling and related problems.
  • Online algorithms for server problems.
  • Randomized algorithms.
  • String algorithms.
  • Flow problems.

Charles University | Information system of Charles University |