Minimum Color Spanning Circle in Imprecise Setup

0548659 - ÚI 2022 RIV CH eng C - Conference Paper (international conference)
Acharyya, Ankush - Jallu, Ramesh Kumar - Keikha, Vahideh - Löffler, M. - Saumell, Maria
Minimum Color Spanning Circle in Imprecise Setup.
Computing and Combinatorics: 27th International Conference, COCOON 2021 Proceedings. Cham: Springer, 2021 - (Chen, C.; Hon, W.; Hung, L.; Lee, C.), s. 257-268. Lecture Notes in Computer Science, 13025. ISBN 978-3-030-89542-6. ISSN 0302-9743.
[COCOON 2021: International Conference on Computing and Combinatorics /27./. Tainan (TW), 24.10.2021-26.10.2021]
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
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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.
Permanent Link: http://hdl.handle.net/11104/0324709