一、課程說明(Course Desc<x>ription)
<br>There are many discrete optimization problems that are NP-complete. That is, we 
<br>cannot 
<br>obtain 
<br>the optimal solution for these problems unless P=NP. In this class, we will study 
<br>how to 
<br>obtain a 
<br>near optimal solution for these problems.
<br>
<br> 二、指定用書(Text Books)
<br>
<br>“The Design of Approximation Algorithms", David P. Williamson and David B. 
<br>Shmoys, Cambridge
<br>
<br>
<br> 三、參考書籍(References)
<br>
<br>
<br>
<br>
<br> 四、教學方式(Teaching Method)
<br>
<br>Lecture
<br>
<br>
<br> 五、教學進度(Syllabus)
<br>
<br>
<br>
<br>六、成績考核(Evaluation)
<br>
<br>
<br>七、可連結之網頁位址
<br>
<br>
<br>
<br>
<br>