Theory of Approximation Algorithms

고려대학교
Ding-Zhu Du

페이스북 트위터 카카오톡 네이버밴드 링크복사

주제분류

공학 >컴퓨터ㆍ통신 >정보통신공학
강의학기

2011년 2학기

조회수

4,199

In study of NP-hard problems, many efforts have been made in design and analysis of approximation algorithms. Indeed, this is a hot research subject in computer science, not only in theory but also in systems because most of optimization problems raised in system research are NP-hard. This series of lectures is based on a newly published book (Ding-Zhu Du, Ker-I Ko, Xioadong Hu, Design and Analysis of Approximation Algorithms, Springer, 2011).

수강안내 및 수강신청
※ 수강확인증 발급을 위해서는 수강신청이 필요합니다

Theory of Approximation Algorithms (Part I)

차시별 강의

1.		Theory of Approximation Algorithms (Part I)
2.		Theory of Approximation Algorithms (Part Ⅱ)
3.		Theory of Approximation Algorithms (Part Ⅲ)
4.		Theory of Approximation Algorithms (Part Ⅳ)