Approximating Integer Programming Problems by Partial Resampling
Why it's on BrighterTube
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceCovers approximation methods for integer programming using partial resampling, teaching a specific algorithmic technique for NP-hard optimization. Instructs a concrete approximation algorithm.
What you'll learn
A 53-minute video from Microsoft Research: “Approximating Integer Programming Problems by Partial Resampling”.
Video by Microsoft Research, played through YouTube's embedded player.