Results 1  10
of
39,083
An Exact Algorithm for the Channel Assignment Problem
, 2002
"... A channel assignment problem is determined by a triple (V; E; w) where V is a vertex set, E an edge set and w is a function assigning edges positive integer weights. An assignment c of integers between 1 and K to the vertices is proper if jc(u) c(v)j w(uv) for each uv 2 E; the smallest K for wh ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
A channel assignment problem is determined by a triple (V; E; w) where V is a vertex set, E an edge set and w is a function assigning edges positive integer weights. An assignment c of integers between 1 and K to the vertices is proper if jc(u) c(v)j w(uv) for each uv 2 E; the smallest K
A Theorem about the Channel Assignment Problem
, 2001
"... A list channel assignment problem is a triple (G, L, w) where G is a graph, L is a function assigning vertices of G lists of integers (colours) and w is a function assigning edges of G positive integers (weights). A colouring c of the vertices of G is proper if c(v) ∈ L(v) for each vertex v ..."
Abstract

Cited by 30 (8 self)
 Add to MetaCart
A list channel assignment problem is a triple (G, L, w) where G is a graph, L is a function assigning vertices of G lists of integers (colours) and w is a function assigning edges of G positive integers (weights). A colouring c of the vertices of G is proper if c(v) ∈ L(v) for each vertex
ON THE SPAN OF A RANDOM CHANNEL ASSIGNMENT PROBLEM
, 2002
"... In the radio channel assignment problems considered here, we must assign a ‘channel ’ from the set 1,2,... of positive integers to each of n transmitters, and we wish to minimise the span of channels used, subject to the assignment leading to an acceptable level of interference. A standard form of ..."
Abstract
 Add to MetaCart
In the radio channel assignment problems considered here, we must assign a ‘channel ’ from the set 1,2,... of positive integers to each of n transmitters, and we wish to minimise the span of channels used, subject to the assignment leading to an acceptable level of interference. A standard form
Tight lower bound for the channel assignment problem
"... We study the complexity of theChannel Assignment problem. A major open problem asks whether Channel Assignment admits an O(cn)time algorithm, for a constant c independent of the weights on the edges. We answer this question in the negative i.e. we show that there is no 2o(n logn)time algorithm sol ..."
Abstract
 Add to MetaCart
We study the complexity of theChannel Assignment problem. A major open problem asks whether Channel Assignment admits an O(cn)time algorithm, for a constant c independent of the weights on the edges. We answer this question in the negative i.e. we show that there is no 2o(n logn)time algorithm
Genetic Algorithms Approach to the Channel Assignment Problem
 in Proc. 1995 AsiaPacific Conference on Communications
, 1995
"... The optimal assignment problem of channels has become increasingly important since the usable range of the frequency spectrum is limited. Recently Genetic Algorithms (GAs) have been proposed as new computational tools for solving optimization problems. GAs are more attractive than other optimization ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The optimal assignment problem of channels has become increasingly important since the usable range of the frequency spectrum is limited. Recently Genetic Algorithms (GAs) have been proposed as new computational tools for solving optimization problems. GAs are more attractive than other
Fuzzy Hopfield Neural Network Approach to the Channel Assignment Problem
"... AbstractThis paper presents a novel approach to solve channel assignment problems by using clustering technique with Fuzzy Hopfield neural network (FHNN). Channels are regarded as data sample and cells are taken as clusters. Channels are adequately distributed to the dedicated cells while satisfyin ..."
Abstract
 Add to MetaCart
AbstractThis paper presents a novel approach to solve channel assignment problems by using clustering technique with Fuzzy Hopfield neural network (FHNN). Channels are regarded as data sample and cells are taken as clusters. Channels are adequately distributed to the dedicated cells while
A Novel Approach to the Fixed Channel Assignment Problem *
"... A critical task in the design of a cellular radio network is to determine a spectrumefficient and conflictfree allocation of channels among the cells. In this paper, we propose a new approach to the Fixed Channel Assignment (FCA) problem. By preserving the cosite channel constraint throughout our ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A critical task in the design of a cellular radio network is to determine a spectrumefficient and conflictfree allocation of channels among the cells. In this paper, we propose a new approach to the Fixed Channel Assignment (FCA) problem. By preserving the cosite channel constraint throughout
A doubly cyclic channel assignment problem
 Discrete Applied Mathematics
, 1997
"... A standard model for radio channel assignment involves a set V of sites, the set (0, 1,2,..} of channels, and a constraint matrix (w(u,v)) specifying minimum channel separations. An assignment f: V + {0,1,2,...} is feasible if the distance I.f(u) f(u)1 b w(u, u) for each pair of sites u and u. The ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. The aim is to find the least k such that there is a feasible assignment using only the k channels 0, 1,.., k 1, and to find a corresponding optimal assignment. We consider here a related problem involving also two cycles. There is a given cyclic order r on the sites, and feasible assignments f must also
Results 1  10
of
39,083