Minimum color spanning circle of imprecise points

• The smallest minimum color-spanning circle (S-MCSC) problem can be solved in O ( n k log ⁡ ) time. largest (L-MCSC) is NP-Hard. A 1 3 -factor 2 , if no two distinct color disks intersect) approximation to the L-MCSC computed Let R a set of colored imprecise points, where each point by one colors. Each specified unit disk which lies. We study computing and possible spanning circle, among all choices points inside their corresponding disks. present an time algorithm compute circle. Regarding we show that NP - Hard algorithm. improve factor for case intersect.