Алгоритмы и структуры данных 12. Потоки минимальной стоимости

Опис:

At 0:00 the lecture begins with the application of flows to find maximum matching; at 5:20 the Shor‑Wagner algorithm is introduced; at 18:27 a proof of a statement from the algorithm is presented; at 19:43 a lemma is discussed; at 35:02 the concept of minimum‑cost flows is explained; at 42:21 a lemma on flow decomposition is presented; at 46:39 another lemma is covered; at 58:20 a statement is made; at 1:07:18 Johnson potentials are introduced.