Approximating Integer Programming Problems by Partial Resampling

About this video

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

Covers approximation algorithms for integer programming. Technical lecture on randomized methods and complexity guarantees for hard optimization problems.

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

Part of Programming and Programming Languages