| 題名: | 兩起點最佳通訊擴展樹之近似演算法 |
| 其他題名: | Approximation algorithms for the two-source optimum communication spanning trees |
| 作者: | Wu, Bang Ye |
| 關鍵字: | approximation algorithms network design spanning trees |
| 期刊名/會議名稱: | 2001 NCS會議 |
| 摘要: | 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. |
| 日期: | 2006-10-16T05:35:42Z |
| 分類: | 2001年 NCS 全國計算機會議 |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs002001000002.pdf | 171.58 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。