Finding Broadcast 2-Medians on a Weighted Tree underthe Postal Model
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 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 ex...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/p7555w |