On the span in channel assignment problems: bounds, computing and counting
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,...
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
2003
|