Skip to content

A Lasserre-Based (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints

About this video

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

Presents approximation algorithm for makespan scheduling with precedence constraints. Concrete optimization technique with proven bounds and methodology.

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