Experiments with a randomized algorithm for a frequency assignement problem. ## AbstractThe problems of assigning frequencies to transmitters can be naturally modelled by generalizations of graph coloring problems.We start with a randomized graph coloring algorithm of Petford and Welsh and propose a randomized algorithm for minimizing the number of constraints violated when a set of frequencies available is fixed. Experiments on instances of various types relevant to mobile communication networks are reported.
[Edit] |