Discrete Mathematics - Topics on domination
Journal of Computer and System Sciences
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
On conflict-free coloring of points and simple regions in the plane
Proceedings of the nineteenth annual symposium on Computational geometry
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
How many wireless resources are needed to resolve the hidden terminal problem?
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.05 |
The paper considers the geometric conflict-free coloring problem, introduced in [G. Even, Z. Lotker, D. Ron, S. Smorodinsky, Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks, SIAM J. Comput. 33 (2003) 94-133]. The input of this problem is a set of regions in the plane and the output is an assignment of colors to the regions, such that for every point p in the total coverage area, there exist a color i and a region D such that p@?D, the region D is colored i, and every other region D^' that contains p is not colored i. The target is to minimize the number of colors used. This problem arises from issues of frequency assignment in radio networks. The paper presents an O(1) approximation algorithm for the conflict-free coloring problem where the regions are unit disks.