1. | Introduction & Stable Matching | Introduction & Stable Matching | ||
Introduction & Stable Matching | Introduction & Stable Matching | |||
2. | Algorithm Analysis (Big-O notation) | Algorithm Analysis (Big-O notation) | ||
3. | Greedy Algorithms | Greedy Algorithms | ||
Greedy Algorithms | Greedy Algorithms | |||
4. | Minimum Spanning Tree | Minimum Spanning Tree | ||
Minimum Spanning Tree | Minimum Spanning Tree | |||
5. | Divide and Conquer | Divide and Conquer | ||
Divide and Conquer | Divide and Conquer | |||
6. | Dynamic Programming | Dynamic Programming | ||
Dynamic Programming | Dynamic Programming | |||
7. | Dynamic Programming | Dynamic Programming | ||
8. | Mid-term | Mid-term | ||
9. | Dynamic Programming | Dynamic Programming | ||
Dynamic Programming | Dynamic Programming | |||
10. | Dynamic Programming | Dynamic Programming | ||
11. | Network Flow | Network Flow | ||
Network Flow | Network Flow | |||
12. | Network Flow | Network Flow | ||
13. | Intractability | Intractability | ||
Intractability | Intractability | |||
14. | Intractability | Intractability | ||
15. | Coping with Intractability | Coping with Intractability | ||
Coping with Intractability | Coping with Intractability |