LP&CO 2026 Lecture-28: Towards a primal-dual algorithm for the Shortest Path Problem & CS conditions
Nishad-Kothari-IIT-Madras · 48:29 · Watch on YouTube
This lecture builds a primal-dual algorithm for the s–t shortest path problem. Complementary slackness (CS) conditions guide every step. Starting from an all-zero dual, the algorithm repeatedly raises the label of the...