完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Ting, H.F. | |
| dc.contributor.author | Wong, W.H. | |
| dc.date.accessioned | 2009-08-23T04:39:15Z | |
| dc.date.accessioned | 2020-05-25T06:25:02Z | - |
| dc.date.available | 2009-08-23T04:39:15Z | |
| dc.date.available | 2020-05-25T06:25:02Z | - |
| dc.date.issued | 2006-10-26 | |
| dc.date.submitted | 1996-12-19 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2540 | - |
| dc.description.abstract | In this paper, we study the problem of bounded length tree linear broadcast routing (BLTLB). Chou and Gopal [2] proved that this problem is NP-compete. Our contribution is to present the first approximation algorithm which achieves a constant performance ratio. | |
| dc.description.sponsorship | 中山大學,高雄市 | |
| dc.format.extent | 8p. | |
| dc.format.extent | 552776 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1996 ICS會議 | |
| dc.subject | Broadcast Routing | |
| dc.subject | Approximation Algorithm | |
| dc.subject | Lower Bound | |
| dc.subject.other | Network Algorithms | |
| dc.title | An Approximation Algorithm for Bounded Length Tree Linear Broadcast Routing | |
| 分類: | 1996年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics001996000116.pdf | 539.82 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。