Journal article icon

Journal article

On the span in channel assignment problems: Bounds, computing and counting

Abstract:

The channel assignment problem involves assigning radio channels to transmitters, using a small span of channels but without causing excessive interference. We consider a standard model for channel assignment, the constraint matrix model, which extends ideas of graph colouring. Given a graph G=(V,E) and a length l(uv) for each edge uv of G, we call an assignment φ:V→{1,t} feasible if |φ(u)-φ(v)|l(uv) for each edge uv. The least t for which there is a feasible assignment is the span of the pro...

Expand abstract

Actions


Access Document


Authors


Journal:
Discrete Mathematics
Volume:
266
Issue:
1-3
Pages:
387-397
Publication date:
2003-05-06
DOI:
ISSN:
0012-365X
URN:
uuid:22d28abc-8856-4ee2-a6dd-7f0c6c2e1dc5
Source identifiers:
359755
Local pid:
pubs:359755
Language:
English
Keywords:

Terms of use


Metrics


Views and Downloads






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

TO TOP