DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bae, Sang-Won | ko |
dc.contributor.author | Lee, Chun-Seok | ko |
dc.contributor.author | Choi, Sung-Hee | ko |
dc.date.accessioned | 2011-02-14T01:28:36Z | - |
dc.date.available | 2011-02-14T01:28:36Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2010-07 | - |
dc.identifier.citation | INFORMATION PROCESSING LETTERS, v.110, no.16, pp.672 - 678 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | http://hdl.handle.net/10203/22084 | - |
dc.description.abstract | We study the Euclidean bottleneck Steiner tree problem: given a set P of n points in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edge in the tree is minimized. This problem is known to be NP-hard even to approximate within ratio root 2 and there was no known exact algorithm even for k = 1 prior to this work. In this paper, we focus on finding exact solutions to the problem for a small constant k. Based on geometric properties of optimal location of Steiner points, we present an optimal Theta(n log n)-time exact algorithm for k = 1 and an O(n(2))-time algorithm for k = 2. Also, we present an optimal Theta(n log n)-time exact algorithm for any constant k for a special case where there is no edge between Steiner points. (C) 2010 Elsevier B.V. All rights reserved. | - |
dc.description.sponsorship | The authors thank anonymous referees for valuable comments to improve our paper. | en |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | APPROXIMATION ALGORITHM | - |
dc.subject | PLANE | - |
dc.title | On exact solutions to the Euclidean bottleneck Steiner tree problem | - |
dc.type | Article | - |
dc.identifier.wosid | 000280205500012 | - |
dc.identifier.scopusid | 2-s2.0-77953650348 | - |
dc.type.rims | ART | - |
dc.citation.volume | 110 | - |
dc.citation.issue | 16 | - |
dc.citation.beginningpage | 672 | - |
dc.citation.endingpage | 678 | - |
dc.citation.publicationname | INFORMATION PROCESSING LETTERS | - |
dc.identifier.doi | 10.1016/j.ipl.2010.05.014 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Choi, Sung-Hee | - |
dc.contributor.nonIdAuthor | Bae, Sang-Won | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Computational geometry | - |
dc.subject.keywordAuthor | Bottleneck Steiner tree | - |
dc.subject.keywordAuthor | Exact algorithm | - |
dc.subject.keywordAuthor | Farthest-color Voronoi diagram | - |
dc.subject.keywordPlus | APPROXIMATION ALGORITHM | - |
dc.subject.keywordPlus | PLANE | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.