近似算法讨论班 (Fall 2011)

Syllabus

• Time: every Thursday, 6:30pm.
• Place: CS building, 228.

• Organizer: 尹一通

• office: CS building, 804
• email: yitong.yin@gmail.com

Reference materials

• Vijay Vazirani. Approximation Algorithms. Springer, 2004.
• David Williamson and David Shmoys. The Design of Approximation Algorithms. Cambridge Univ Press, 2011.

Schedule

Dates	Speakers	Topics
9.26	张弛豪（上海交通大学）	Introduction to approximation algorithms. Approximation ratio; set cover; rounding an LP; LP duality; greedy algorithms. Chap.1 of Williamson-Shmoys.
10.8	张弛豪（上海交通大学）	Greedy algorithms and local search. Scheduling with deadlines; [math]\displaystyle{ k }[/math]-center; minimize makespan; metric TSP; min-degree spanning tree. Chap.2 of Williamson-Shmoys.