The Weighted Backup 2-center Problem on Paths

• Main Authors: Ming-Wei Shao, 邵明偉
• Other Authors: Kun-Mao Chao
• Format: Others
• Language: en_US
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/24899198315613900929

碩士 === 國立臺灣大學 === 資訊工程學研究所 === 102 === In this thesis, we apply the reliability-based backup 2-center model proposed by Wang, where each facility may fail with a given probability. Once a facility fails, the other has to be responsible for all the services. We assume that two facilities do not fail at the same time. In the weighted backup 2-center problem on paths, we want to locate two facilities on vertex-weighted paths such that the expected weighted distance is minimized. We construct an O(n)-time algorithm, where n is the number of vertices in the given path.