Hardness results and efficient approximations for frequency assignment problems : Radio labelling and radio coloring
Dimitris A. Fotakis, Sotiris Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis · DSpace - NTUA (National Technical University of Athens) · 2001
The Frequency Assignment Problem (FAP) in radio networks is the problem of assigning frequencies to transmitters exploiting frequency reuse while keeping signal interference to acceptable levels. The FAP is usually modeled by variations of graph coloring. In this work we study two (similar but still different) frequency assignment problems: radio labelling and radio-coloring. For radio labelling we prove that it