๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The channel assignment problem for mutually adjacent sites

โœ Scribed by Jerrold R Griggs; Daphne Der-Fen Liu

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
668 KB
Volume
68
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Adjacency on the constrained assignment
Adjacency on the constrained assignment problem
โœ Abdo Y. Alfakih; Katta G. Murty ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 416 KB

Let Qc,, be the integer hull of the intersection of the assignment polytope with a given hyperplane H = {X = (xii) E Wx" : c:=, cJ=, ct,xij = r}. W e 5 .h ow that the problem of checking whether two given extreme points of Qc,r are nonadjacent c = (cl,) is a O-l matrix, and that it is NP-Complete if

On-line algorithms for the channel assig
On-line algorithms for the channel assignment problem in cellular networks
โœ Pilu Crescenzi; Giorgio Gambosi; Paolo Penna ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 364 KB

We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem for temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we chara

A channel assignment problem for optical
A channel assignment problem for optical networks modelled by Cayley graphs
โœ Sanming Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 239 KB

A problem arising from a recent study of scalability of optical networks seeks to assign channels to the vertices of a network so that vertices distance 2 apart receive distinct channels. In this paper we introduce a general channel assignment scheme for Cayley graphs on abelian groups, and derive u