Hardness Results and Efficient Approximations For Frequency Assignment Problems: Radio Labelling and Radio Coloring

摘要

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 first survey the variations of the FAP and then we study two (similar but still different) frequency assignment problems: radio labelling and radiocoloring.