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 · 82% confidence

Presents approximation techniques for scheduling with constraints. Lecture on polynomial-time algorithms for NP-hard problems using semidefinite programming.

A 48-minute video from Microsoft Research: “A Lasserre-Based (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints”.

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