Finding a Broadcast Median with Time Constraint on aWeighted Tree
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 106 === We propose the problem of finding a broadcast median on a weighted tree with time con- straint under the postal model. Given a weighted tree T = (V,E) with time constraint t, the overall delay of a vertex v ∈ V (T ), is the minimum sum of the transmission tim...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/6gqzer |