## Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks (2002)

### Cached

### Download Links

- [www.eng.tau.ac.il]
- [www.math.tau.ac.il]
- [disco.ethz.ch]
- DBLP

### Other Repositories/Bibliography

Citations: | 42 - 7 self |

### BibTeX

@MISC{Even02conflict-freecolorings,

author = {Guy Even and Zvi Lotker and Dana Ron and Shakhar Smorodinsky},

title = {Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks},

year = {2002}

}

### Years of Citing Articles

### OpenURL

### Abstract

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, S), where each S 2 S is a subset of X . The output is a coloring of the sets in S that satisfies the following constraint: for every x 2 X there exists a color i and a unique set S 2 S, such that x 2 S and (S) = i. The goal is to minimize the number of colors used by the coloring .

### Citations

972 | Computational Geometry: Algorithms and Applications - Berg - 2000 |

416 | DavenportSchinzel Sequence and Their Geometric Applications
- Sharir, Agarwal
- 1995
(Show Context)
Citation Context ...garding the envelope of R ′ is that if every boundary segment is given a symbol that corresponds to the rectangle it belongs to, then the sequence of symbols is a Davenport–Schinzel sequence DS(n, 2) =-=[SA95]-=-. Namely, no two consecutive symbols are equal, and there is no alternating subsequence of length 4 (i.e., no “...a...b...a...b...” for every pair of symbols a ̸= b). As a consequence, if two rectangl... |

238 |
Unit disk graphs
- Clark, Colbourn
- 1990
(Show Context)
Citation Context ...is problem is not easier than vertex coloring in graphs and is even equally hard to approximate. An adaptation of the NP-completeness proof of minimum coloring of intersection graphs of unit disks by =-=[CCJ90]-=- proves that even CF-coloring of unit disks (or unit squares) in the plane is NP-complete. Since this proof is based on a reduction from coloring planar graphs, it follows that approximating the minim... |

176 | Zero Knowledge and the Chromatic Number
- Feige, Kilian
- 1998
(Show Context)
Citation Context ... above, min-CF-coloring of general set systems is not easier (even to approximate) than vertex-coloring in graphs. The latter problem is of course known to be NP-hard, and is hard even to approximate =-=[FK98]-=-. The problem remains hard for the special case of unit disks (and squares), and it is even NP-hard to achieve an approximation ratio of 4 3 − ε for every ε>0(byan adaptation of [CCJ90]). Marathe et a... |

126 | Simple Heuristics for Unit Disk Graphs - Marathe, Breu, et al. - 1995 |

111 |
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization
- BAR-YEHUDA, GOLDREICH, et al.
- 1992
(Show Context)
Citation Context ...ed to the problem of minimizing the number of time slots required to broadcast information in a single-hop radio network. In view of this relation, it has been observed by Bar-Yehuda ([B01], based on =-=[BGI92]-=-) that every set system (X, S) can be CFmulticolored using O(log |X|·log |S|) colors. Mathematical optimization techniques have been used to solve a family of frequency assignment problems that arise ... |

75 | Models and solution techniques for the frequency assignement problem - Aardal, Hoesel, et al. - 2003 |

73 | Models and approximation algorithms for channel assignment in radio networks
- Krumke, Marathe, et al.
(Show Context)
Citation Context ...of intersection graphs of unit disks. They presented an approximation algorithm with an approximation ratio of 3. Motivated by channel assignment problems in radio networks, Krumke, Marathe, and Ravi =-=[KMR01]-=- presented a 2-approximation algorithm for theCONFLICT-FREE COLORING OF SIMPLE GEOMETRIC REGIONS 99 distance-2 coloring problem in families of graphs that generalize intersection graphs of disks. A n... |

35 | Conflict-Free coloring of points and simple regions in the plane - Har-Peled, Smorodinsky - 2005 |

33 | Introduction to geometry, 2nd ed - Coxeter - 1969 |

30 | Efficiently fourcoloring planar graphs - Robertson, Sanders, et al. - 1996 |

19 | Combinatorial Problems in Computational Geometry - Smorodinsky - 2005 |

18 | A polynomial-time approximation scheme for base station positioning in UMTS networks - Galota - 2000 |

11 |
Private communication
- Bar-Yehuda
(Show Context)
Citation Context ...problem is related to the problem of minimizing the number of time slots required to broadcast information in a single-hop radio network. In view of this relation, it has been observed by Bar-Yehuda (=-=[B01]-=-, based on [BGI92]) that every set system (X, S) can be CFmulticolored using O(log |X|·log |S|) colors. Mathematical optimization techniques have been used to solve a family of frequency assignment pr... |

6 | D.: Towards high order constraint representations for the frequency assignment problem
- Dunkin, Bater, et al.
- 1998
(Show Context)
Citation Context ...deled in this fashion because CF-coloring allows for conflicts between base-stations, provided that another base-station serves the “area of conflict.” Even models that use nonbinary constraints (see =-=[DBJC98]-=-) do not capture CF-coloring. We note that the above models take into account interferences between close frequencies, while we have ignored this issue for the sake of simplicity. We can, however, inc... |

1 | Facility location with interference", manuscript 2001 - Abrams, Konemann, et al. |

1 | Introduction to Geometry", 2nd ed - Coxeter - 1969 |

1 | Automatic Cell Planning for Mobile Network Design: Optimization Models and Algorithms - Huang - 2001 |

1 | On Con Coloring of Points", in preparation - Har-Peled, Smorodinsky - 2002 |

1 | Relaxing planarity for topological graphs", Discrete and Comput. Geom - Pach, Toth |

1 | Facility Location with Interference, Working paper 2001-E23 - Abrams, Könemann, et al. - 2001 |

1 | Every planar map is 4-colorable—1 - Appel, Haken - 1977 |

1 | Every planar map is 4-colorable—2 - Appel, Haken - 1977 |

1 |
Conflict free colorings, in The Goodman Pollack Festschrift, Algorithms Combin
- Pach, Tóth
- 2003
(Show Context)
Citation Context ...Let R⊆2X denote the set of ranges obtained by intersecting X with all scaled translations of C. Then there exists a CF-coloring of X with respect to R using O(log |X|) colors. Recently, Pach and Tóth =-=[PT03]-=- proved that Ω(log |X|) colors are required for CF-coloring every set X of points in the plane with respect to disks. 1.2.2. CF-coloring of chains. A chain S is a collection of subsets, each assigned ... |