Course: Algorithms for Hard Problems

» List of faculties » PRF » KMI
Course title Algorithms for Hard Problems
Course code KMI/PGSAT
Organizational form of instruction Lecture
Level of course Doctoral
Year of study not specified
Semester Winter and summer
Number of ECTS credits 12
Language of instruction Czech, English
Status of course unspecified
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Bělohlávek Radim, prof. RNDr. Ph.D., DSc.
  • Jančar Petr, prof. RNDr. CSc.
Course content
unspecified

Learning activities and teaching methods
unspecified
Learning outcomes
Prerequisites
unspecified

Assessment methods and criteria
unspecified
Recommended literature
  • Ausiello G. et al. (1999). Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin.
  • Hlum J., Grohe M. (2006). Parameterized Complexity Theory. Springer.
  • Hromkovič J. (2003). Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. 2nd Edition. Springer.
  • Vazirani, Vijay V. (2003). Approximation Algorithms. Springer.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester