SubjectsSubjects(version: 850)
Course, academic year 2019/2020
   Login via CAS
Introduction to approximation and randomized algorithms - NDMI084
Title in English: Úvod do aproximačních a pravděpodobnostních algoritmů
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2019
Semester: winter
E-Credits: 5
Hours per week, examination: winter s.:2/1 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: Czech, English
Teaching methods: full-time
Guarantor: prof. RNDr. Jiří Sgall, DrSc.
doc. Mgr. Petr Kolman, Ph.D.
Class: Informatika Bc.
Classification: Informatics > Optimalization
Annotation -
Last update: RNDr. Ondřej Pangrác, Ph.D. (14.02.2018)
This course covers techniques for design and analysis of algorithms, demonstrated on concrete combinatorial problems. For many optimization problems it is impossible (or NP-hard) to design algorithms that find an optimal solution fast. In such a case we study approximation algorithms that work faster, at the cost that we find a good solution, not necessarily an optimal one. Often we use randomness in design of algorithms, which allows to solve problems more efficiently or even to solve problems that are otherwise intractable. Recommended for the 3rd year of Bc. studies.
Course completion requirements -
Last update: prof. RNDr. Jiří Sgall, DrSc. (12.10.2017)

To pass the tutorials it is required to get at least a half of total points for homeworks assigned during the semester. Due to the requirements, additional attempts to pass the tutorial are excluded.

The exam is oral. The requirements correspond to the syllabus as covered by the lectures. Passing the turorials is required before taking the exam.

Literature -
Last update: G_I (28.05.2012)

D. P. Williamson, D. B. Shmoys: The Design of Approximation Algorithms, Cambridge University Press, 2011.

J. Kleinberg, E. Tardos: Algorithm Design, Pearson, 2006.

V.V. Vazirani: Approximation Algorithms, Springer, 2001.

R. Motwani, P. Raghavan: Randomized algorithms.

M. Mitzenmacher, E. Upfal: Probability and Computing: Randomized Algorithms and Probabilistic Analysis.

Requirements to the exam -
Last update: prof. RNDr. Jiří Sgall, DrSc. (22.06.2019)

The exam is oral with time for written preparation. The requirements correspond to the syllabus as covered by the lectures. Passing the turorials is required before taking the exam.

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

Covered techniques:

  • Greedy algorithms as a design method for approximation and online algorithms
  • Use of linear programming for approximation algorithms
  • Pairwise independent random variables
  • Derandomization using the conditional expectations technique
  • Local search

Covered problems and algorithms:

  • scheduling and disjoint paths in graphs - greedy algorithms
  • travelling salesperson problem - combinatorial algorithms
  • set cover - greedy algorithm, use of linear programming
  • satisfiability (MAX-SAT) - use of linear programming, randomized rounding, derandomization
  • dynamic and static hashing - randomized algorithms, pairwise independent variables
  • maximal cut - approximation using local search
  • minimal cut - a fast randomized algorithm
  • maximal independent set - a fast randomized parallel algorithm
  • verification of matrix equation - a randomized protocol

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html