活動起日：2018-05-11 發佈日期：2018-05-04 瀏覽數：443 2018-05-07 更新
講者：林妙聰教授（交通大學 資訊管理與財務金融學系 ）
講題: Packing and Covering of Subsets
時間：2018 年 5 月 11 日 13:30
地點：管一 203 教室
The first part is dedicated to the optimization problems of packing and covering of subsets. Due to the NP-hardness of the studied problem, approximation algorithms have been extensively developed. We focus on theoretical approaches. Randomized approximation algorithms and their associated performance ratio analysis will be introduced. Implications to a sensor network problem follow. In this talk, we will also share and exchange experience and ideas in research endeavors.