Back to Search
Start Over
Minimum color spanning circle of imprecise points.
- Source :
-
Theoretical Computer Science . Sep2022, Vol. 930, p116-127. 12p. - Publication Year :
- 2022
-
Abstract
- • The smallest minimum color-spanning circle (S-MCSC) problem can be solved in O (n k log n) time. • The largest minimum color-spanning circle (L-MCSC) problem is NP-Hard. • A 1 3 -factor (1 2 , if no two distinct color disks intersect) approximation to the L-MCSC problem can be computed in O (n k log n) time. 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 (n k 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 1 3 -factor approximation algorithm. We improve the approximation factor to 1 2 for the case where no two disks of distinct color intersect. [ABSTRACT FROM AUTHOR]
- Subjects :
- *NP-hard problems
*COLORS
*COLOR
*CIRCLE
*PROTHROMBIN
*APPROXIMATION algorithms
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 930
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 158672555
- Full Text :
- https://doi.org/10.1016/j.tcs.2022.07.016