完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Wu, Bang Ye | |
| dc.date.accessioned | 2009-08-23T04:47:16Z | |
| dc.date.accessioned | 2020-05-29T06:16:14Z | - |
| dc.date.available | 2009-08-23T04:47:16Z | |
| dc.date.available | 2020-05-29T06:16:14Z | - |
| dc.date.issued | 2006-10-16T05:35:42Z | |
| dc.date.submitted | 2001-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/1546 | - |
| dc.description.abstract | negative edge lengths. Given two vertices as sources and all vertices as destinations, and aslo given arbitrary requirements between sources and destinations, we investigated the problem how to construct a spanning tree of G such that the total communication cost from sources to destinations is minimum, where the communication cost from a source to a destination is the path length multiplied by their requirement. In the paper, we present a 3-approximation algorithm for general graph inputs, and a 2-approximation algorithm for metric graphs. | |
| dc.description.sponsorship | 中國文化大學,台北市 | |
| dc.format.extent | 5p. | |
| dc.format.extent | 175702 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2001 NCS會議 | |
| dc.subject | approximation algorithms | |
| dc.subject | network design | |
| dc.subject | spanning trees | |
| dc.subject.other | Interconnection networks | |
| dc.title | 兩起點最佳通訊擴展樹之近似演算法 | |
| dc.title.alternative | Approximation algorithms for the two-source optimum communication spanning trees | |
| 分類: | 2001年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs002001000002.pdf | 171.58 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。