Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/4659| Title: | 具時間限制的廣播中心問題 Broadcast Centers in Trees with Time Constraints |
| Authors: | Yu-Shiang Huang 黃煜翔 |
| Advisor: | 陳健輝(Gen-Huey Chen) |
| Co-Advisor: | 林清池(Ching-Chi Lin) |
| Keyword: | 廣播中心點問題,時間限制,異質郵寄模型,樹狀結構,貪進法, broadcast center problem,time constraint,heterogeneous postal model,trees,greedy method, |
| Publication Year : | 2015 |
| Degree: | 碩士 |
| Abstract: | 本論文提出一 O(n) 時間複雜度的演算法來解決樹狀結構上的廣播中心點問題，使廣播中心點的數量最少。廣播按照異質郵寄模型的規則進行，需在時間限制內完成。 In this thesis, we present a O(n)-time exact algorithm to find a broadcast strategy such that broadcasting can be completed within the time constraint and the number of centers is minimal. The given graph is a tree and broadcasting is under the heterogeneous postal model. |
| URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/4659 |
| Fulltext Rights: | 同意授權(全球公開) |
| Appears in Collections: | 資訊工程學系 |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| ntu-104-1.pdf | 684.89 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.