Unit Covering in Color-Spanning Set Model
WALCOM, pp. 44-52, 2015.
In this paper, we consider two new variants of the unit covering problem in color-spanning set model: Given a set of n points in d-dimensional plane colored with m colors, the MinCSBC problem is to select m points of different colors minimizing the minimum number of unit balls needed to cover them. Similarly, the MaxCSBC problem is to cho...More
Full Text (Upload PDF)
PPT (Upload PPT)