Conflict-free coloring made stronger Conference Paper uri icon

abstract

  • 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(logn) colors. That is, it can be colored with O(logn) colors such that for any (covered) point p there is some disc whose color is distinct from all other colors of discs containing p. They also showed that this bound is asymptotically tight. In this paper we prove the following stronger results: (i) Any set of n discs in the plane can be colored with a total of at most O(k logn) colors such that (a) for any point p that is covered by at least k discs, there are at least k distinct discs each of which is colored by a color distinct from all other discs containing p and (b) for any point p covered by at most k discs, all discs covering p are colored distinctively. We call such a coloring a k-Strong Conflict-Free coloring. We extend this result to pseudo-discs and arbitrary regions with linear union-complexity. (ii) More generally, for families of n simple closed Jordan regions with union-complexity bounded by O(n1+α), we prove that there exists a k-Strong Conflict-Free coloring with at most O(knα) colors. (iii) We prove that any set of n axis-parallel rectangles can be k-Strong Conflict-Free colored with at most O(k log2n) colors. (iv) We provide a general framework for k-Strong Conflict-Free coloring arbitrary hypergraphs. This framework relates the notion of k-Strong Conflict-Free coloring and the recently studied notion of k-colorful coloring. All of our proofs are constructive. That is, there exist polynomial time algorithms for computing such colorings.

publication date

  • January 1, 2010