算法設計要論

貪欲法 (Greedy Algorithms) 分割統治法 (Divide and Conquer) 動的計画法 (Dynamic Programming) ネットワークフロー (Network Flow) 計算困難性 (Intractability) 近似アルゴリズム (Approximation Algorithms)

オンデマンドでの講義を主体とし，随時問題演習を行う. 10月7日（火）10時25分にZoomにて講義の説明を行う. また, 次の日程（10/7, 10/14,10/21,10/28, 11/4, 11/11, 11/18, 12/9, 12/16, 12/23, 1/6, 1/13）にて日本語・英語での質問をZoomで受け付ける. 質問者が10時25分〜10時40分に来ない場合には, Zoomを終了する. This course consists of on-demand lectures and problem-solving exercises. A course overview will be explained via Zoom at 10:25 AM on October 7th. Students can ask questions in either Japanese or English during the following office hours, all starting at 10:25 AM: October 7, October 14, October 21, October 28, November 4, November 11, November 18, December 9, December 16, December 23, January 6, January 13. If no student arrives between 10:25 and 10:40, the Zoom session will be ended.

学期末に試験を行う. また随時演習問題をレポートとして解いてもらう. / A final exam will be conducted. Further, students will be required to solve practice problems as reports.

Jon Kleinberg and Eva Tardos: Algorithm Design, Pearson, 2005

Cormen et al.: Introduction to Algorithms, MIT Press, 2009

なし