Program
Design and analysis of approximation algorithms
Student No.:50
Time:Tue/Thu 13:00-14:50
Instructor:Ker-I Ko  [State University of New York at Stony Brook]
Place:Conference Room3, Floor 2, Jin Chun Yuan West Building
Starting Date:2013-2-26
Ending Date:2013-5-9

Description:

 

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.

 

Prerequisite:

 

An undergraduate class on Algorithms.

 

Reference:

 

 

 

 

 

Du, D., Ko, K. and Hu, X., Design and Analysis of Approximation Algorithms, Springer, 2012.http://www.springer.com/mathematics/book/978-1-4614-1700-2
 
堵丁柱,葛可一,胡晓东,近似算法的设计与分析,高等教育出版社,2011.

http://product.china-pub.com/198504