Sciweavers

COMPGEOM
2006
ACM

Conflict-free colorings of shallow discs

14 years 2 months ago
Conflict-free colorings of shallow discs
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 discs there is at least one disc in the collection containing p whose color differs from that of all other members of the collection that contain p. This is motivated by a problem on frequency assignments in cellular networks, and improves the best previously known upper bound of O(log n) when k is much smaller than n.
Noga Alon, Shakhar Smorodinsky
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where COMPGEOM
Authors Noga Alon, Shakhar Smorodinsky
Comments (0)