http://ir.sinica.edu.tw/handle/201000000A/36982| DC Field | Value | Language |
|---|---|---|
| dc.contributor | 資訊科學研究所 | - |
| dc.contributor | 資訊科技創新研究中心 | - |
| dc.contributor.author | Kao, Mong-Jen | - |
| dc.contributor.author | Katz, Bastian | - |
| dc.contributor.author | Krug, Marcus | - |
| dc.contributor.author | Lee, D. T. | - |
| dc.contributor.author | Noellenburg, Martin | - |
| dc.contributor.author | Rutter, Ignaz | - |
| dc.date.accessioned | 2020-10-23T02:10:10Z | - |
| dc.date.available | 2020-10-23T02:10:10Z | - |
| dc.date.issued | 2011-08-01 | - |
| dc.identifier.uri | http://ir.sinica.edu.tw/handle/201000000A/36982 | - |
| dc.description.sponsorship | 資訊科學研究所 | - |
| dc.description.sponsorship | 資訊科技創新研究中心 | - |
| dc.language.iso | en | - |
| dc.title | Connecting Two Trees with Optimal Routing Cost | - |
| dc.type | conference paper | - |
| dc.relation.conference | Proc. 23rd Canadian Conference on Computational Geometry (CCCG\'11) | - |
| dc.description.note | 已出版;有審查制度;具代表性 | - |
| item.languageiso639-1 | en | - |
| item.fulltext | no fulltext | - |
| item.grantfulltext | none | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_5794 | - |
| item.openairetype | conference paper | - |
| item.cerifentitytype | Publications | - |
| crisitem.author.dept | Institute of Information Science | - |
| crisitem.author.parentorg | Division of Mathematics and Physical Sciences | - |
| Appears in Collections: | 資訊科學研究所 | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
