Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks
Authors:
- G. EvenGEG. Even
- Z. LotkerZLZ. Lotker
- D. RonDRD. Ron
- S. SmorodinskySSS. Smorodinsky
- 26 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 691-700
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks2003
- Models and Approximation Algorithms for Channel Assignment in Radio NetworksWireless Networks, 2001
- Zero Knowledge and the Chromatic NumberJournal of Computer and System Sciences, 1998
- Simple heuristics for unit disk graphsNetworks, 1995
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomizationJournal of Computer and System Sciences, 1992
- Unit disk graphsDiscrete Mathematics, 1990