MIT 6.854 Spring 2016 Lecture 9: Min Cost Flow, Goldberg-Tarjan

preview_player
Показать описание
Recorded by Andrew Xia 2016
Рекомендации по теме
Комментарии
Автор

0:00 - 8:50 recap of the last lecture
8:50 - 13:50 how can we find a negative cost cycle if there is one? (digression to Bellman-Ford)
13:50 - 18:35 how many iterations does Klein's cycle cancelling algo take? O(m*C*U), so naive implementation of Klein's takes O(m^2*n*C*U) (Bellman-Ford used internally O(m*n))
18:35 - 27:50 Goldberg-Tarjan
27:50 - 42:45 lemma 1 proof: mi == epsilon
43:00 - 53:05 lemma 2 proof
54:00 - 1:03:25 lemma 3 proof (couldn't prove it so renamed it to conjecture xD)
1:04:30 - 1:09:20 finishing up Goldberg-Tarjan
1:09:20 - 1:12:00 attempt to solve lemma 3
1:12:00 applications

aleksagordic
Автор

Thanks @Andrew Xia for recording the videos!

itadeufa