| Week #
| Description
| Reading
|
| 1
| Introduction to course, Paging problem
| Pages 1-3
|
| 2
| Steiner Trees
| Pages 4-7
|
| 3
| Load Balancing
| Pages 8-12
|
| 4
| Load Balancing, the one infinity case
| Pages 13-15
|
| 5
| Yao Minimax, Unrelated Machines, Application to Routing
| Pages 14-22
|
| 6
| Online Load balancing of temporary tasks, Multicommodity flows
| Pages 23-29
|
| 7
| Congestion Model of Multicommodity flows, Paper on Adwords presented by Bahman Bahmani
| Pages 30-32, Paper
|
| 8
| Paper on Bartals approximation for HST's presented by Shaddin Dughmi
| Paper
|
| 8
| Paper on Online Convex programming and gradient descent presented by Justin Lebar
| Paper
|
| 9
| Kalai Vempala's paper on online decision problems presented by Justin Solomon
| Paper, Notes
|