Visa version
Version skapad av Viktoria Fodor 2016-11-13 19:00
Visa
< föregående
|
nästa >
Jämför
< föregående
|
nästa >
Schedule
This is a preliminary schedule, to show the structure of the course. Small changes may happen. All lectures at in the LCN seminar room, Osquldas vag 6-8, floor 4.
| 1. Monday, Nov 7, 10:15 | Basics, greedy algorithms, KT Ch 2,4 |
| 2. Wednesday, Nov 9, 10:15 | Divide and conquer, Dynamic programming, KT Ch 5,6 |
| 3. Monday, Nov 14, 10:15 | Graphs and flows, KT Ch 3,7 |
| 4. Wednesday, Nov 16, 10:15 | Complexity, KT Ch 8,10 |
| 5. Monday, Nov 21, 10:15 | Greedy, DKH Ch 1-2 |
| 6. Wednesday, Nov 23, 10:15 | Restriction, DKH Ch 3 |
| 7. Monday, Nov 28, 10:15 | Relaxation, DKH Ch 6 + student presentations |
| 8. Thursday, Dec 1, 10:15 | LP, DKH Ch 7 + student presentations |
| 9. Wednesday, Dec 7, 10:15 | LP, DKH Ch 7 + student presentations |
| 10. Wednesday, Dec 14, 10:15 | Primal-Dual, Local Ratio, DKH Ch 8 + student presentations |
KT: Jon Kleinberg, Éva Tardos, “Algorithm Design”
DKH: Ding-Zhu Du, Ker-I Ko, Xiaodong Hu, “Design and Analysis of Approximation Algorithms”