Conflict-Free Coloring Made Stronger

Elad Horev, Roi Krakovski, Shakhar Smorodinsky

In FOCS 2002, Even et al. showed that any set of $n$ discs in the plane can be Conflict-Free colored with a total of at most $O(\log n)$ colors. That is, it can be colored with $O(…