LP&CO 2026 Lecture-35
Nishad-Kothari-IIT-Madras · 69:36 · Watch on YouTube
The lecture assembles a primal-dual algorithm for minimum-cost perfect matching in a bipartite graph: a dual-feasible labeling, its tight graph, a matching, and an alternating tree are updated together so progress is...