Search for the shortest paths in road networks: from theory to implementation

Next Saturday, Vitaly Osipov (Karlsruhe Institute of Technology) will start a course on algorithms for finding the shortest paths in graphs at the Computer Science club in St. Petersburg. During the course, the algorithms used by millions of people in services such as Google / Bing / Yandex maps will be studied and implemented. As always, admission is free, registration is not required, everyone is welcome.

» Course page on the CS club website
First lecture: Saturday, November 5, 17:20
Location: Steklov Mathematical Institute, St. Petersburg, Fontanka 27, Marble Hall (second floor)