PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Experiments with a randomized algorithm for a frequency assignement problem.
Janez Žerovnik
WSEAS Trans. Math. Volume 3, Number 4, pp. 801-806, 2004.

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.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:688
Deposited By:Boris Horvat
Deposited On:30 December 2004