Skip to content

Breaking the Multicommodity Flow Barrier for ?log(n)-Approximations to Sparsest Cut

About this video

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

Addresses approximation algorithms for the sparsest-cut problem. Teaches algorithmic techniques and complexity bounds for a fundamental graph-partitioning problem.

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