流水號
14986
課號
EE5182
課程識別碼
921 U2590
無分班
- 3 學分
授課對象
電機工程學研究所
- 選修
陳和麟 副教授
- 搜尋教師開設的課程
電機資訊學院 電機工程學系
holinchen@ntu.edu.tw
- 明達館 718
02-33663595
- 搜尋教師開設的課程
- 四 2, 3, 4
明達231
3 類登記
修課總人數 180 人
本校 180 人
無領域專長
- 中文授課
- 核心能力與課程規劃關聯圖
- 備註
本校選課狀況
載入中...
- 課程概述This course will study various techniques for designing and analyzing algorithms. We will mainly focus on problems for which the exact algorithm is not known or not efficient enough and problems with resource constraints. Besides designing efficient algorithms, proving the performance guarantees is also a main topic of this course. Some topics that we will cover are as follows: Approximation Algorithms: Algorithms that find near-optimal solutions with provable performance guarantees in polynomial time. This course will mainly focus on approximation algorithms for NP-hard problems. Randomized Algorithms: Algorithms that use random numbers. We will focus on algorithms with provable success probabilities and good expected solution quality. Streaming Algorithms: Algorithms that solve problems on massive datasets. In this type of problem, usually, the algorithm is only allowed to read the data once and use no more than a constant or poly-logarithmic amount of space. Online Algorithm: The input to the problem is not known in advance and arrives over time. An online algorithm must decide how to process a specific input before seeing future inputs. The goal is to perform as well as an algorithm that knows all inputs beforehand. We will cover algorithm design techniques such as hashing, sampling, and linear programming.
- 課程目標本課程主要針對從事演算法研究的學生,提供演算法設計的技巧與未來學習的方向。
- 課程要求預修課程: 演算法、機率、離散數學、資料結構
- 預期每週課後學習時數
- Office Hour
星期四 12:00 - 13:00 TA office hours: 林芃廷 r10921092@ntu.edu.tw office hour:Mon 10:00-12:00 MD709 王怡堯 r10921104@ntu.edu.tw office hour:Fri 13:20-15:20 MD709 *此 Office Hour 需要提前預約
- 指定閱讀相關論文
- 參考書目Design of Approximation Algorithms, Williamson and Shmoys Randomized Algorithms, Motwani and Raghavan Approximation Algorithms, Vazirani
- 評量方式
40%
作業約四次作業 30%
期中考30%
期末考
- 針對學生困難提供學生調整方式
調整方式 說明 上課形式 以錄影輔助
提供學生彈性出席課程方式
- 課程進度
第 1 週 Course Overview Knapsack Problem PTAS/FPTAS 第 2 週 Approximation Algorithms: Subset Sum and Bin Packing 第 3 週 Linear Programming, ILP & LP relaxation, Vertex Cover, Set Cover 第 4 週 Integrality Gap, Facility Location Problem, LP Duality 第 5 週 Primal-Dual Algorithms (Set Cover, Facility Location) 第 6 週 Greedy and Local Search Algorithms (Facility Location, k-median) 第 7 週 Solving Linear Programs (Simplex Method, Ellipsoid Method), HW solutions 第 8 週 Midterm 第 9 週 Midterm solutions, Randomized Algorithms, Derandomization 第 10 週 Randomized Rounding 第 11 週 Hashing 第 12 週 Markov Chain, Random Walk 第 13 週 Counting and Sampling 第 14 週 Streaming Algorithms, Online Algorithms 第 15 週 Online Algorithms, HW3-4 solutions, Recap 第 16 週 Final Exam