Online conflict-free coloring for intervals
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the chromatic number of some geometric hypergraphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Conflict-free colorings of shallow discs
Proceedings of the twenty-second annual symposium on Computational geometry
How to play a coloring game against a color-blind adversary
Proceedings of the twenty-second annual symposium on Computational geometry
Conflict-free coloring for intervals: from offline to online
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Conflict-free coloring for rectangle ranges using O(n.382) colors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Weakening the online adversary just enough to get optimal conflict-free colorings for intervals
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic conflict-free coloring for intervals: From offline to online
ACM Transactions on Algorithms (TALG)
Coloring Axis-Parallel Rectangles
Computational Geometry and Graph Theory
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
ACM Transactions on Algorithms (TALG)
Dynamic Offline Conflict-Free Coloring for Unit Disks
Approximation and Online Algorithms
Conflict-free coloring of unit disks
Discrete Applied Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
Conflict-free colourings of graphs and hypergraphs
Combinatorics, Probability and Computing
Notes: Coloring axis-parallel rectangles
Journal of Combinatorial Theory Series A
Online conflict-free colouring for hypergraphs
Combinatorics, Probability and Computing
Graph unique-maximum and conflict-free colorings
Journal of Discrete Algorithms
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Hitting sets online and vertex ranking
ESA'11 Proceedings of the 19th European conference on Algorithms
Conflict-Free colorings of rectangles ranges
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Computing the independence number of intersection graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Conflict-Free coloring made stronger
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Ordered coloring grids and related graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Graph unique-maximum and conflict-free colorings
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Coloring half-planes and bottomless rectangles
Computational Geometry: Theory and Applications
Conflict-Free Coloring of points on a line with respect to a set of intervals
Computational Geometry: Theory and Applications
Coloring planar homothets and three-dimensional hypergraphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Proceedings of the twenty-eighth annual symposium on Computational geometry
VCM: the vector-based coloring method for grid wireless ad hoc and sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Online conflict-free colorings for hypergraphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Topological graphs: empty triangles and disjoint matchings
Proceedings of the twenty-ninth annual symposium on Computational geometry
Coloring planar homothets and three-dimensional hypergraphs
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem that we call minimum conflict-free coloring (min-CF-coloring). In its general form, the input of the min-CF-coloring problem is a set system $(X,{\cal S})$, where each $S \in {\cal S}$ is a subset of X. The output is a coloring $\chi$ of the sets in ${\cal S}$ that satisfies the following constraint: for every $x \in X$ there exists a color $i$ and a unique set $S \in {\cal S}$ such that $x \in S$ and $\chi(S) = i$. The goal is to minimize the number of colors used by the coloring $\chi$. Min-CF-coloring of general set systems is not easier than the classic graph coloring problem. However, in view of our motivation, we consider set systems induced by simple geometric regions in the plane. In particular, we study disks (both congruent and noncongruent), axis-parallel rectangles (with a constant ratio between the smallest and largest rectangle), regular hexagons (with a constant ratio between the smallest and largest hexagon), and general congruent centrally symmetric convex regions in the plane. In all cases we have coloring algorithms that use O(log n) colors (where n is the number of regions). Tightness is demonstrated by showing that even in the case of unit disks, $\Theta(\log n)$ colors may be necessary. For rectangles and hexagons we also obtain a constant-ratio approximation algorithm when the ratio between the largest and smallest rectangle (hexagon) is a constant. We also consider a dual problem of CF-coloring points with respect to sets. Given a set system $(X,{\cal S})$, the goal in the dual problem is to color the elements in X with a minimum number of colors so that every set $S \in {\cal S}$ contains a point whose color appears only once in S. We show that O(log |X|) colors suffice for set systems in which X is a set of points in the plane and the sets are intersections of X with scaled translations of a convex region. This result is used in proving that O(log n) colors suffice in the primal version.