Journal article icon

Journal article

A doubly cyclic channel assignment problem

Abstract:

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 |f(u) − f(v)∣⩾w(u, v) for each pair of sites u and v. The aim is to find the least k such that there is a feasible a...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

Actions


Access Document


Files:
Publisher copy:
10.1016/S0166-218X(97)00094-2

Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical,Physical & Life Sciences Division - Statistics
Publisher:
Elsevier B.V. Publisher's website
Journal:
Discrete Applied Mathematics Journal website
Volume:
80
Issue:
2-3
Pages:
263-268
Publication date:
1997-12-05
DOI:
ISSN:
0166-218X
URN:
uuid:2ac38770-afa7-4faf-9e0d-21517169a5ee
Local pid:
ora:8446

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP