|
|
|
||
Last update: RNDr. Ondřej Pangrác, Ph.D. (14.02.2018)
|
|
||
Last update: doc. Mgr. Petr Kolman, Ph.D. (29.09.2020)
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. If university attendance is limited, the exam may be held online. |
|
||
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. |
|
||
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. |
|
||
Last update: doc. Mgr. Petr Kolman, Ph.D. (29.09.2020)
Detailed information about the course are given at the web page https://kam.mff.cuni.cz/~kolman/intapxalg.html . Here is a list of the main topics.
Covered techniques:
Covered problems and algorithms:
|