LP&CO 2026 Lecture-34
0:00 · Watch on YouTube
This lecture finishes a worked bipartite example of a simple primal-dual minimum-cost perfect-matching algorithm, writes the loop down, and proves that rational costs make it terminate, with a step count that still de...