2 search results - page 1 / 1 » Conflict-free colorings of shallow discs |
ICALP
2007
Springer
13 years 8 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
COMPGEOM
2006
ACM
13 years 8 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...