Design and Analysis of Algorithms
Instructor: Vitaly Skachek
Teaching assistants: Oliver-Matis Lill, Eldho K. Thomas, Behzad Abdolmaleki
Lecture: Wed. 12.15 - 14.00, J. Liivi 2 - 404
Practice: Mon. 16.15 - 18.00, Paabel 220 or Tue. 16.15 - 18.00, Paabel 219 or Wed. 10.15 - 12.00, Paabel 220
Office hours: to be announced
Language: English
Contact: Vitaly Skachek
Final exam
There are two options for the date of the final exam.
- Option 1: Wednesday, 19 December 2018, at 12:15, Liivi 2-404 (the regular lecture time and place).
- Option 2: Wednesday, 16 January 2018, at 12:15,
Liivi 2-403--please note the room change.
A student can choose any of these two options. The duration of the exam is 1 hour 40 minutes. Any written and printed material is allowed in the exam. No electronic devices are allowed (no phones, computers, tablets, calculators, etc.)
Literature
- S. Dasgupta, C. Papadimitriou and U. Vazirani, Algorithms, McGraw Hill, New York 2008.
- V.V. Vazirani, Approximation Algorithms, Springer-Verlag, Berlin 2003.
- S. Even, Graph Algorithms, 2nd edition, Cambridge University Press, New York 2012.
- T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, MIT Press, Boston 2009.
Course description
This course focuses on design and analysis of advanced algorithms in computer science. It is advised to take Algorithms and Data Structures (MTAT.03.133) and Advanced Algorithmics (MTAT.03.238) before you take this course or in parallel. In comparison to "Advanced Algorithmics", this course will emphasize the analysis of the algorithms (proof of correctness, complexity analysis), and will not focus on implementations and programming.
Grading policy
There will be six homeworks and the final exam. The final grade will be based on the grade of homeworks (60%) and of the final exam (40%). The homeworks will mainly contain questions of design and of analysis of algorithms, and typically will not contain programming tasks.
Syllabus
The following is a preliminary list of topics (some deviations from this list are possible):
Part 1: Deterministic algorithms
- Fast Fourier transform. Algorithm for fast multiplication of polynomials.
- Algorithms for finding a minimum spanning tree in a graph.
- Flow networks. Efficient algorithm for finding a maximum flow in a network.
- Finding maximum flow in 0-1 network.
- Finding a minimum cost flow. Finding a minimum cost matching in a bipartite graph.
- Linear programming. Feasible solution. Primal and dual problem.
Part 2: Approximation algorithms
- Approximation algorithm for set cover problem.
- Travelling salesman problem.
- Knapsack problem.
- Linear programming in approximation algorithms.
- Linear programming approach to set cover problem.
- Primal-dual approach.