A Second Course in Algorithms (Lecture 5: Minimum-Cost Bipartite Matching)
Tim Roughgarden Lectures
0:00 / 0:00
A Second Course in Algorithms (Lecture 5: Minimum-Cost Bipartite Matching)
11 790 просмотров · 10 лет назад
Tim Roughgarden Lectures
30,1 тыс. подписчиков
11 790 просмотров · 10 лет назад
Minimum-cost bipartite matching. Optimality conditions. The Hungarian (Kuhn-Munkres/Jacobi) algorithm.
Full course playlist: • A Second Course in Algorithms (Stanford CS...
Lecture notes: http://timroughgarden.org/w16/l/l5.pdf
