Let P be a set of n colored points in the d-dimensional Euclidean space. Introduced by Hart (1968), consistent subset P, is $$S\subseteq P$$ such that for every point p $$P {\setminus } S$$ , closest S has same color as p. The problem to find with minimum cardinality. This known NP-complete even two-colored sets. Since initial presentation this problem, aside from hardness results, there not be...