| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 106 === This thesis presents an O(n√n log n) time complexity algorithm for solving broadcast 2-medians problem on a weighted tree under the postal model. First,we prove that a centroid is the broadcast 1-median. Next, we can observe
that in broadcast 2-median, there exists an unused edge, so we compute thebroadcast time for the subtree of each edge in both side. Finally, for best time complexity, binary indexed tree data structure is used to compute the broadcast time, which can save time from recomputing the duplicated part of
subtree.
|
|---|
