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,E)...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2003
|