Approximability of the Unique Coverage Problem
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceAnalyzes the computational complexity of the Unique Coverage problem. Theoretical computer science lecture on problem hardness and approximation.
A 60-minute video from Microsoft Research: “Approximability of the Unique Coverage Problem”.
Video by Microsoft Research, played through YouTube's embedded player.