Advanced Algorithms

Lecturer:M. Böhlen
Teaching assistant:Juozas Gordevicius
Teaching language:English
Prerequisites:Data structures and algorithms
Office hours:Friday 12:30-14:00 (prior notification by email required)
Objectives: The design, analysis and implementation of advanced algorithms covers different application areas, types of objects, requirements, and design and analysis techniques. This course surveys the field of advanced algorithms and investigates selected topics in the areas of graph theory and algorithms, computational geometry, text search, and approximation algorithms. It emphasizes basic concepts, techniques, and examples.

Syllabus: The course covers selected topics from the following areas: all-pairs shortest paths, max flows, computational geometry, text searching, and approximation algorithms.

Teaching format: Lectures and exercises.

Assessment: The assessment is based on a written exam at the end of the course. There is no midterm.

Reading List: The course follows chapters 25, 26, 33, 32, and 35 of the Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein (CLRS). Sample copies of the book are available at the library. Online resources for buying the book: MIT Press and Amazon and Google Books.

Learning outcome: Understand the general concepts and techniques to design and analyze advanced algorithms. Ability to study and understand advanced algorithms in textbooks.

Schedule: Unless stated otherwise lectures take place Monday from 8:30 until 10:30 in room D003 at the following dates: There are six lab sessions each one lasting 2 hours from 16:00 until 18:00. The labs take place in room E531 at the following dates: