Algorithm Design and Analysis (AI1401)

Autumn Semester

to undergraduates, School of Mathematics

Textbook

[DPV07] S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani. Algorithms, 2007. [a local copy]

Lectures

Lecture 1. Prologue.

Lecture 2. Algorithms with Numbers I.

Lecture 3. Algorithms with Numbers II.

Lecture 4. Divide-and-Conquer I.

Lecture 5. Divide-and-Conquer II.

Lecture 6. Decompositions of graphs I.

Lecture 7. Decompositions of graphs II.

Lecture 8. Paths in graphs I.

Lecture 9. Paths in graphs II.

Lecture 10. Greedy Algorithms I.

Lecture 11. Greedy Algorithms II.

Lecture 12. Advanced data structures

Lecture 13. Dynamic Programming I.

Lecture 14. Dynamic Programming II.

Lecture 15. Linear Programming I.

Lecture 16. Linear Programming II.

Lecture 17. Linear Programming III.

Lecture 18. NP Problem I.

Lecture 19. NP Problem II.

Lecture 20. NP Problem III.

Lecture 21. Coping with NP I.

Lecture 22. Coping with NP II.

Lecture 23. Coping with NP III.

Lecture 24. Conclusion.

Materials

Guoqiang Li
Last modified: Sunday, June 1, 2025.