DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kang, Byeonguk | - |
dc.contributor.author | Choi, Jongmin | - |
dc.contributor.author | Ahn, Hee-Kap | - |
dc.date.accessioned | 2022-03-11T05:40:19Z | - |
dc.date.available | 2022-03-11T05:40:19Z | - |
dc.date.created | 2022-03-11 | - |
dc.date.issued | 2021-07-05 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/110813 | - |
dc.description.abstract | We consider the Euclidean 2-center problem for a set of n disks in the plane: find two smallest congruent disks such that every disk in the set intersects at least one of the two congruent disks. We present a deterministic algorithm for the problem that returns an optimal pair of congruent disks in O(n | - |
dc.language | English | - |
dc.publisher | Springer Science and Business Media Deutschland GmbH | - |
dc.relation.isPartOf | 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021 | - |
dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.title | Intersecting Disks Using Two Congruent Disks | - |
dc.type | Conference | - |
dc.type.rims | CONF | - |
dc.identifier.bibliographicCitation | 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, pp.400 - 413 | - |
dc.citation.conferenceDate | 2021-07-05 | - |
dc.citation.conferencePlace | CN | - |
dc.citation.endPage | 413 | - |
dc.citation.startPage | 400 | - |
dc.citation.title | 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021 | - |
dc.contributor.affiliatedAuthor | Kang, Byeonguk | - |
dc.contributor.affiliatedAuthor | Choi, Jongmin | - |
dc.contributor.affiliatedAuthor | Ahn, Hee-Kap | - |
dc.identifier.scopusid | 2-s2.0-85111965107 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
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.