Conference item icon

Conference item

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...

Expand abstract
Publication status:
Published

Actions


Access Document


Authors


Volume:
266
Issue:
1-3
Pages:
387-397
Host title:
DISCRETE MATHEMATICS
Publication date:
2003-05-06
DOI:
ISSN:
0012-365X
Source identifiers:
102298
Pubs id:
pubs:102298
UUID:
uuid:178a603d-87e7-43a6-a0c0-e94cdf08f40e
Local pid:
pubs:102298
Deposit date:
2012-12-19

Terms of use


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