| dc.contributor | 資科系 | - |
| dc.creator (作者) | 郭桐惟 | - |
| dc.creator (作者) | Kuo, Tung-Wei | - |
| dc.date (日期) | 2019-07 | - |
| dc.date.accessioned | 22-Jun-2020 14:35:35 (UTC+8) | - |
| dc.date.available | 22-Jun-2020 14:35:35 (UTC+8) | - |
| dc.date.issued (上傳時間) | 22-Jun-2020 14:35:35 (UTC+8) | - |
| dc.identifier.uri (URI) | https://ah.lib.nccu.edu.tw/item?item_id=149172 | - |
| dc.format.extent | 522765 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Theoretical Computer Science, 32-46 | - |
| dc.subject (關鍵詞) | Connected dominating set ; Spanner ; Set cover with pairs ; MIN-REP problem | - |
| dc.title (題名) | On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint | - |
| dc.type (資料類型) | article | - |
| dc.identifier.doi (DOI) | 10.1007/978-3-030-14094-6_3 | - |
| dc.doi.uri (DOI) | https://doi.org/10.1007/978-3-030-14094-6_3 | - |
