DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oh, E. | - |
dc.contributor.author | Ahn, H.-K. | - |
dc.date.accessioned | 2019-12-05T09:50:03Z | - |
dc.date.available | 2019-12-05T09:50:03Z | - |
dc.date.created | 2019-03-26 | - |
dc.date.issued | 2019-08 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/100365 | - |
dc.description.abstract | Given a set P of n points in the plane and a multiset W of k weights with k <= n, we assign each weight in W to a distinct point in P to minimize the maximum weighted distance from the weighted center of P to any point in P. In this paper, we present an algorithm which takes O(k(2)n(2) log(3)n) time for the problem. We also consider the case that all weights in W are at most 1, and present an O(k(5)n log(3)k + kn log(3)n)-time algorithm. For a constant k, it takes only O(n log(3)n) time, which is near linear. (C) 2019 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | Elsevier BV | - |
dc.relation.isPartOf | Computational Geometry: Theory and Applications | - |
dc.title | Assigning weights to minimize the covering radius in the plane | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.comgeo.2018.10.007 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | Computational Geometry: Theory and Applications, v.81, pp.22 - 32 | - |
dc.identifier.wosid | 000468713600003 | - |
dc.citation.endPage | 32 | - |
dc.citation.startPage | 22 | - |
dc.citation.title | Computational Geometry: Theory and Applications | - |
dc.citation.volume | 81 | - |
dc.contributor.affiliatedAuthor | Oh, E. | - |
dc.contributor.affiliatedAuthor | Ahn, H.-K. | - |
dc.identifier.scopusid | 2-s2.0-85062383564 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.type.docType | Article | - |
dc.subject.keywordPlus | Computational geometry | - |
dc.subject.keywordPlus | Covering radius | - |
dc.subject.keywordPlus | Distinct points | - |
dc.subject.keywordPlus | Minimum radius | - |
dc.subject.keywordPlus | Multiset | - |
dc.subject.keywordPlus | Time algorithms | - |
dc.subject.keywordPlus | Weight assignment | - |
dc.subject.keywordPlus | Weighted center | - |
dc.subject.keywordPlus | Weighted distance | - |
dc.subject.keywordPlus | Applications | - |
dc.subject.keywordAuthor | Minimum radius | - |
dc.subject.keywordAuthor | Weight assignment | - |
dc.subject.keywordAuthor | Weighted center | - |
dc.subject.keywordAuthor | Weighted distance | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.