In the present dissertation we investigate structural and algorithmic aspects of the frequency assignment problem in mobile telephone networks. This problem is of particular interest for the graph theory because of its close relationship to graph coloring. The frequency assignment problem includes the characteristic features of T-coloring, list coloring,… (More)
This paper studies the channel stability number, a combinatorial function that has been introduced for evaluating frequency allocation plans for hybrid cellular networks. We present several results concerning the approximability of this function in the case of complete graphs and analyze how diierent constraints innuence its computational complexity.
This paper presents an analysis of the channel assignment problem in wireless telephone networks with both fixed and dynamic transmitters. It is shown how an assignment plan can be computed for the fixed part of the network so that enough room is left for flexible channel selections by the dynamic transmitters. Optimization criteria are defined for the… (More)