Minimum color spanning circle of imprecise points

0562741 - ÚI 2023 RIV NL eng J - Journal Article
Acharyya, Ankush - Jallu, Ramesh Kumar - Keikha, Vahideh - Löffler, M. - Saumell, Maria
Minimum color spanning circle of imprecise points.
Theoretical Computer Science. Roč. 930, September 2022 (2022), s. 116-127. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA ČR(CZ) GJ19-06792Y
EU Projects: European Commission(ES) 734922
Institutional support: RVO:67985807
Keywords : Color spanning circle * Imprecise points * Algorithms * Computational complexity * Colored points
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 1.1, year: 2022
Method of publishing: Limited access
https://dx.doi.org/10.1016/j.tcs.2022.07.016

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 (nk log 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. (c) 2022 Elsevier B.V. All rights reserved.
Permanent Link: https://hdl.handle.net/11104/0335586


Research data: ArXiv.org