Media Summary: This is a laid-back/casual talk discussing recent progress on Sharat Ibrahimpur (Waterloo); Chaitanya Swamy (Waterloo) Textbooks: Computational Complexity: A Modern Approach by S. Arora and B. Barak.
Approximation Algorithms For Makespan Minimization - Detailed Analysis & Overview
This is a laid-back/casual talk discussing recent progress on Sharat Ibrahimpur (Waterloo); Chaitanya Swamy (Waterloo) Textbooks: Computational Complexity: A Modern Approach by S. Arora and B. Barak. This video explores the Traveling Salesman Problem, and explains two ... wait 130 years and that's the kind of key idea behind this whole study of CMU 15-251: Great Ideas in Theoretical Computer Science Spring 2016 Lecture :
![Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines [Research Talk]](https://i.ytimg.com/vi/YRqnuOwiHio/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.1: Makespan Minimization) [Part 1 of 2]](https://i.ytimg.com/vi/fn5HNoiMwHM/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.1: Makespan Minimization) [Part 2 of 2]](https://i.ytimg.com/vi/CcdYLcLymV4/mqdefault.jpg)
![[OR1-Modeling] Lecture 3: Integer Programming #9 Machine scheduling: Makespan minimization](https://i.ytimg.com/vi/OHy_UdB4TSs/mqdefault.jpg)
