Experiments with a Randomized Algorithm for a Frequency Assignment Problem

Abstract : The 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.
Document type :
Reports
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101949
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:10:32 AM
Last modification on : Wednesday, November 20, 2019 - 3:13:25 AM

File

RR1997-27.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101949, version 1

Collections

Citation

Janez Zerovnik. Experiments with a Randomized Algorithm for a Frequency Assignment Problem. [Research Report] LIP RR-1997-09, Laboratoire de l'informatique du parallélisme. 1997, 2+15p. ⟨hal-02101949⟩

Share

Metrics

Record views

4

Files downloads

7