Optimal channel allocation for several types of cellular radio networks

AbstractThe channel allocation problem in cellular radio networks is formulated as an optimization problem on set-valued graph colorings. Thereby a common model is found for some optimization criteria that appeared formerly to be distinct. The optimization problem is then transformed to a weighted graph coloring problem. Several efficient algorithms for the weighted coloring on special classes of graphs are known. They are investigated, when they are applied to an instance resulting from a transformation of a channel allocation problem