Computing a minimum-dilation spanning tree is NP-hard
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Cheong, Otfried | ko |
| dc.contributor.author | Haverkort, Herman | ko |
| dc.contributor.author | Lee, Mira | ko |
| dc.date.accessioned | 2013-03-27T04:44:36Z | - |
| dc.date.available | 2013-03-27T04:44:36Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2007-01-30 | - |
| dc.identifier.citation | Computing: The Australasian Theory Symposium (CATS) 2007, pp.15 - 24 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/159206 | - |
| dc.language | English | - |
| dc.publisher | CATS '07 | - |
| dc.title | Computing a minimum-dilation spanning tree is NP-hard | - |
| dc.type | Conference | - |
| dc.identifier.scopusid | 2-s2.0-49549123141 | - |
| dc.type.rims | CONF | - |
| dc.citation.beginningpage | 15 | - |
| dc.citation.endingpage | 24 | - |
| dc.citation.publicationname | Computing: The Australasian Theory Symposium (CATS) 2007 | - |
| dc.identifier.conferencecountry | AT | - |
| dc.contributor.localauthor | Cheong, Otfried | - |
| dc.contributor.nonIdAuthor | Haverkort, Herman | - |
| dc.contributor.nonIdAuthor | Lee, Mira | - |
- Appears in Collection
- CS-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.