Session 4A - The Karger-Stein Algorithm is Optimal for k-cut
2,107 views
About this video
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoEstablishes optimality of Karger-Stein algorithm for minimum k-cut problem. Teaching algorithm design and analysis for graph partitioning.
Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.
Part of STOC 2020