資訊工程研究所(Graduate Institute of Computer Science and Information Engineering)
課程名稱(英文)
Approximation Algorithms and Applications to Networks
課程代碼
4105329_01
授課教師:
郭建志
學分數
3
必/選修
選修
開課年級
碩博合開
先修科目或先備能力:
Discrete Mathematics, Algorithms
課程概述:
Many discrete optimization problems in networks are NP-hard and we cannot obtain the optimal solution for these problems in polynomial time unless P=NP. Therefore, we employ approximation algorithms to come as close as possible to the optimum value in polynomial time, rather than guarantee the best solution. The area has developed many deep and beautiful mathematical results over the years, and it is inherently interesting to study these. In this course, we will study how to obtain a near optimal solution for these problems and their applications in networks.
學習目標:
1. Learn to design approximation algorithms
2. Learn to analyze performance of approximation ratios
3. Learn to improve the design based on the analysis
4. Algorithm implementation and application study (optional)