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

@article{McDiarmid2003OnTS,
  title={On the span in channel assignment problems: bounds, computing and counting},
  author={Colin McDiarmid},
  journal={Discrete Mathematics},
  year={2003},
  volume={266},
  pages={387-397}
}
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… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

A Note on the Complexity of the Chromatic Number Problem

Inf. Process. Lett. • 1976
View 3 Excerpts
Highly Influenced

J

F. Barasi
van den Heuvel, Graph labelling, orientations, and greedy algorithms • 2001
View 2 Excerpts
Highly Influenced

Bounds for the frequency assignment problem

Discrete Mathematics • 1997
View 3 Excerpts
Highly Influenced

Channel assignment and discrete mathematics

C. McDiarmid
in: C. Linhares-Salas, B. Reed (Eds.), Recent Advances in Algorithmic Combinatorics, Springer, Berlin • 2003
View 2 Excerpts

S

R. A. Leese
Hurley (Eds.), Methods and Algorithms for Radio Channel Assignment, Oxford University Press, Oxford • 2003
View 1 Excerpt

Introduction to Graph Theory

D. B. West
2nd Edition, Prentice-Hall, Englewood CliSs, NJ • 2001
View 2 Excerpts

Arrangements

D.J.A. Welsh, G. Whittle
channel assignments and associated polynomials, Adv. Appl. Math. 23 • 1999
View 3 Excerpts

Similar Papers

Loading similar papers…