|Design and analysis of approximation algorithms|
|Instructor：||Ker-I Ko [State University of New York at Stony Brook]|
|Place：||Conference Room3, Floor 2, Jin Chun Yuan West Building|
In this course, we study the design and analysis of approximation algorithms. We present several design techniques for approximation algorithms and the related analysis, including greedy strategy, restriction methods, partition, relaxation methods, and linear programming and local ratio method. Each technique will be illustrated with applications in various areas of computer science.
An undergraduate class on Algorithms.