There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 178 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 157 | - |
dc.citation.title | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | - |
dc.citation.volume | 21 | - |
dc.contributor.author | Brass, Peter | - |
dc.contributor.author | Knauer, Christian | - |
dc.contributor.author | Na, Hyeon-Suk | - |
dc.contributor.author | Shin, Chan-Su | - |
dc.contributor.author | Vigneron, Antoine | - |
dc.date.accessioned | 2023-12-22T06:12:20Z | - |
dc.date.available | 2023-12-22T06:12:20Z | - |
dc.date.created | 2016-06-10 | - |
dc.date.issued | 2011-04 | - |
dc.description.abstract | In this paper we study several instances of the aligned k-center problem where the goal is, given a set of points S in the plane and a parameter k >= 1, to find k disks with centers on a line l such that their union covers S and the maximum radius of the disks is minimized. This problem is a constrained version of the well-known k-center problem in which the centers are constrained to lie in a particular region such as a segment, a line, or a polygon. We first consider the simplest version of the problem where the line I: is given in advance; we can sole this problem in time O(n log(2) n). In the case where only the direction of is fixed, we give an O(n(2) log(2) n)-time algorithm. When l is an arbitrary line, we give a randomized algorithm with expected running time O(n(4) log(2) n). Then we present (1+epsilon)-approximation algorithms for these three problems. When we denote T (k, epsilon) = (k/epsilon(2)+(k/epsilon) log k) log(1/epsilon), these algorithms run in O(n log k+T (k, epsilon)) time, O(n log k vertical bar T(k. epsilon)/epsilon) time, and O(n log k vertical bar T(k. epsilon)/epsilon(2)) time, respectively. For k = O(n(1/ 3) / log n), we also give randomized algorithms with expected running times O(n + (k/epsilon(2)) log(1/epsilon)), O(n + (k/epsilon(3)) log(1/epsilon)), and O(n + (k/epsilon(4)) log(1/epsilon)), respectively | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.21, no.2, pp.157 - 178 | - |
dc.identifier.doi | 10.1142/S0218195911003597 | - |
dc.identifier.issn | 0218-1959 | - |
dc.identifier.scopusid | 2-s2.0-79954483509 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/19640 | - |
dc.identifier.url | http://www.worldscientific.com/doi/abs/10.1142/S0218195911003597 | - |
dc.identifier.wosid | 000289373800002 | - |
dc.language | 영어 | - |
dc.publisher | WORLD SCIENTIFIC PUBL CO PTE LTD | - |
dc.title | THE ALIGNED K-CENTER PROBLEM | - |
dc.type | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.