Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks

Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem called minimum conflict-free coloring (min-CF-coloring). In its general form, the input of the min-CF-coloring problem is a set system (X, S), where each S /spl isin/ S is a subset of X. The output is a coloring X of the sets in S that satisfies the following constraint: for every x /spl isin/ X there exists a color i and a unique set S /spl isin/ S, such that x /spl isin/ S and /spl chi/(S) = i. The goal is to minimize the number of colors used by the coloring X. 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 non-congruent), 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). For rectangles and hexagons we obtain a constant-ratio approximation algorithm when the ratio between the largest and smallest rectangle (hexagon) is a constant. We also show that, even in the case of unit disks, /spl Theta/(log n) colors may be necessary.

[1]  H. Coxeter,et al.  Introduction to Geometry. , 1961 .

[2]  K. Appel,et al.  Every planar map is four colorable. Part II: Reducibility , 1977 .

[3]  K. Appel,et al.  Microfiche supplement to “Every planar map is four colorable” , 1977 .

[4]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[5]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[6]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[7]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[8]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[9]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[10]  P. Jeavons.  Towards High Order Constraint Representations for the Frequency Assignment Problem , 1998 .

[11]  Heribert Vollmer,et al.  A polynomial-time approximation scheme for base station positioning in UMTS networks , 2001, DIALM '01.

[12]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[13]  J. Pach,et al.  Relaxing Planarity for Topological Graphs , 2002 .

[14]  Dana Ron,et al.  Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks , 2003, SIAM J. Comput..

[15]  Carlo Mannino,et al.  Models and solution techniques for frequency assignment problems , 2003, 4OR.

[16]  J. Pach,et al.  Conflict-free colorings , 2003 .

[17]  M. Sharir,et al.  Combinatorial problems in computational geometry , 2003 .

[18]  Sariel Har-Peled,et al.  On conflict-free coloring of points and simple regions in the plane , 2003, SCG '03.