Skip to content

Strongly polynomial algorithm for a class of minimum-cost flow problems

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

Presents a strongly polynomial algorithm for minimum-cost flow problems. Teaches algorithmic technique with proven complexity bounds.

Video by Microsoft Research, played through YouTube's embedded player.