Prefer a chat interface with context about you and your work?
Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
In the conflict-free coloring problem, for a given range space, we want to bound the minimum value F(n) such that every set P of n points can be colored with F(n) colors with the property that every nonempty range contains a unique color. We prove a new upper bound O(n0.368) …