DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Lee, Changryeol | ko |
dc.date.accessioned | 2014-08-29 | - |
dc.date.available | 2014-08-29 | - |
dc.date.created | 2014-02-17 | - |
dc.date.created | 2014-02-17 | - |
dc.date.issued | 2013-06 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.23, no.3, pp.159 - 170 | - |
dc.identifier.issn | 0218-1959 | - |
dc.identifier.uri | http://hdl.handle.net/10203/188665 | - |
dc.description.abstract | Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and straight edges. We consider a broadcasting situation, where one point r is an element of S is a designated source. Given a dilation factor delta, we ask for a geometric network G such that for every point v is an element of S there is a path from r to v in G of length at most delta vertical bar rv vertical bar, and such that the total edge length is minimized. We show that finding such a network of minimum total edge length is NP-hard, and give an approximation algorithm. | - |
dc.language | English | - |
dc.publisher | WORLD SCIENTIFIC PUBL CO PTE LTD | - |
dc.subject | NP-HARD | - |
dc.subject | GRAPHS | - |
dc.title | SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES | - |
dc.type | Article | - |
dc.identifier.wosid | 000329928800001 | - |
dc.identifier.scopusid | 2-s2.0-84892614069 | - |
dc.type.rims | ART | - |
dc.citation.volume | 23 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 159 | - |
dc.citation.endingpage | 170 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | - |
dc.identifier.doi | 10.1142/S0218195913500052 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Lee, Changryeol | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Geometric network | - |
dc.subject.keywordAuthor | spanner | - |
dc.subject.keywordAuthor | minimum spanning tree | - |
dc.subject.keywordAuthor | dilation | - |
dc.subject.keywordAuthor | single source | - |
dc.subject.keywordPlus | NP-HARD | - |
dc.subject.keywordPlus | GRAPHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.