Minimum Color Spanning Circle in Imprecise Setup
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F21%3A00548659" target="_blank" >RIV/67985807:_____/21:00548659 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/21:00353554
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-89543-3_22" target="_blank" >http://dx.doi.org/10.1007/978-3-030-89543-3_22</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-89543-3_22" target="_blank" >10.1007/978-3-030-89543-3_22</a>
Alternative languages
Result language
angličtina
Original language name
Minimum Color Spanning Circle in Imprecise Setup
Original language description
Let R be a set of n colored imprecise points, where each point is colored by one of k colors. Each imprecise point is specified by a unit disk in which the point lies. We study the problem of computing the smallest and the largest possible minimum color spanning circle, among all possible choices of points inside their corresponding disks. We present an O(nklog n) time algorithm to compute a smallest minimum color spanning circle. Regarding the largest minimum color spanning circle, we show that the problem is NP- Hard and present a 13 -factor approximation algorithm. We improve the approximation factor to 12 for the case where no two disks of distinct color intersect.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GJ19-06792Y" target="_blank" >GJ19-06792Y: Structural properties of visibility in terrains and farthest color Voronoi diagrams</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Computing and Combinatorics: 27th International Conference, COCOON 2021 Proceedings
ISBN
978-3-030-89542-6
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
257-268
Publisher name
Springer
Place of publication
Cham
Event location
Tainan
Event date
Oct 24, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000767965300022