演講公告

演講主題：The backup 2-center problem
主講人：王弘倫教授 (國立臺北商業大學資訊與決策科學研究所)
演講日期：2016 年3 月 22 日(星期二) 14:00 - 15:00
演講地點：(光復校區) 科學一館223 室
摘要內容：
The backup 2-center problem is a center facility location problem, in which one is asked to deploy two facilities, with a given probability to fail, in a graph. Given that the two facilities do not fail simultaneously, the goal is to find two locations, possibly on edges, that minimize the expected value of the maximum of the distances from all vertices to their closest functioning facility. In this talk, we focus on the algorithmic results of this problem. In particular, we will briefly review the algorithm for computing the center of a tree, and then show how this idea is applied to solve the backup 2-center problem on a tree.
相關檔案：Talk_1050322.doc

$返回$ go back