CS-580

Topics in Algorithm Design

Postgraduate

This lesson gives a full picture of the typical procedure followed for the algorithmic solution of any specific problem - from the first step, up to the last one: (1) defining a problem; (2) discretization and exhaustive search; (3) “good characterizations”; (4) polynomial algorithms vs NP-complete problems; (5) “accelerating” an algorithm; (6) optimal algorithmic solutions. Within this framework the following issues are presented and analyzed: (a) fundamental concepts, e.g. reductions and complexity classes; (b) general algorithmic design techniques like data structures, dynamic programming, parametric search, linear programming et.al.; and (c) analytical techniques, especially techniques for proving the correctness of algorithms.

Grading:

Specific details on grading can be found on the course’ s website

6

CS-240, CS-280, CS-380

https://elearn.uoc.gr/course/view.php?id=2924