City: Saint Petersburg Novosibirsk Kazan Language: Русский English

Graph Algorithms and Continuous Optimization
Saint Petersburg / spring 2017, посмотреть все семестры

Enroll in the course to get notifications and to be able to submit home assignments.
Register to enroll now Login

Traditionally, we view graphs as purely combinatorial objects and tend to design our graph algorithms to be combinatorial as well. In fact, in the context of algorithms, combinatorial became a synonym of fast.

Recent work, however, shows that a number of such inherently combinatorial graph problems can be solved much faster using methods that are very non-combinatorial. Specifically, by approaching these problems with tools and notions borrowed from linear algebra and, more broadly, from continuous optimization. A notable examples here are the recent lines of work on the maximum flow problem, the bipartite matching problem, and the shortest path problem in graphs with negative-length arcs.

This series of lectures will explore basic concepts that underlie these developments. The topics covered will span key continuous optimization primitives such as gradient descent method, linear system solving, and Newton's method. We will also demonstrate how these tools can be applied to graph algorithms, using the maximum flow problem as illustration.

Курс был прочитан в рамках International Computer Science Student School Recent Advances in Algorithms May 22–26, 2017

Date and time Class|Name Venue|short Materials
22 May
Part 1: Overview, Lecture ПОМИ РАН slides,  video
22 May
Part 2: Unconstrained Minimization, Lecture ПОМИ РАН slides,  videofiles
23 May
Part 3: Fast (Laplacian) Linear System Solving, Lecture ПОМИ РАН slides,  videofiles
24 May
Part 4, Lecture ПОМИ РАН video,  files