Bounds for the frequency assignment problem

Discrete Mathematics

Volumn 167-168, Issue , 1997, Pages 571-582

  Smith, D H ^a   Hurley, S ^b  

^a UNIVERSITY OF GLAMORGAN   (United Kingdom)

^b CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000789601     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00257-9     Document Type: Article

References (24)

1. N.L. Biggs, Some heuristics for graph colouring, in: R. Nelson and R.J. Wilson, eds, Graph Colourings (Longmans, New York, 1990) 87-96.
2. A. Bouju, J.F. Boyce, C.H.D. Dimitropoulos, G. vom Scheidt and J.G. Taylor, Tabu search for the radio links frequency assignment problem, in: Conf. on Applied Decision Technologies: Modem Heuristic Methods, Brunel University (1995) 233-250.
3. D.J. Castelino, S. Hurley and N.M. Stephens, A tabu search algorithm for frequency assignment, Ann. Oper. Res. 63 (1996) 301-319.
4. D. Costa, On the use of some known methods for T-colourings of graphs, Ann. Oper. Res., 41 (1993) 343-358
5. M.B. Cozzens and F.S. Roberts, T-Colorings of graphs and the channel assignment problem, Congr. Numer. 35 (1982) 191-208.
6. M.B. Cozzens and D.-I. Wang, The general channel assignment problem, Congr. Numer. 41 (1984) 115-129.
7. W. Crompton, S. Hurley and N.M. Stephens, Frequency assignment using a parallel genetic algorithm, in: Proc. IEE/IEEE Natural Algorithms in Signal Processing Workshop, vol. 2 (1993) 26/1-26/8.
8. W. Crompton, S. Hurley and N.M. Stephens, A parallel genetic algorithm for frequency assignment problems, in: Proc. IMACS/IEEE Conf. on Signal Processing, Robotics and Neural Networks, Lille, France (1994) 81-84.
9. B. Descartes, Solution to advanced problem number 4526, Amer. Math. Monthly 61 (1954) 352.
10. A. Gamst, Homogeneous distribution of frequencies in a regular hexagonal cell system, IEEE Trans. Vehicular Techn. 31 (1982) 132-144.
11. A. Gamst, Some lower bounds for a class of frequency assignment problems, IEEE Trans. Vehicular Techn. 35 (1986) 8-14.
12. M. Gendreau, P. Soriano and L. Salvail, Solving the maximum clique problem using a tabu search approach, Ann. Oper. Res. 41 (1993) 385-403.
13. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
14. W.K. Hale, New spectrum management tools, in: Proc. IEEE Internat. Symp. on Electromagnetic Compatibility Record (1981) 47-53.
15. J.B. Kruskal Jr., On the shortest spanning subtree of a graph and the travelling salesman problem, Proc. Amer. Math. Soc. 7 (1956) 48-50.
16. T.A. Lanfear, Graph theory and radio frequency assignment, NATO EMC Analysis Project No. 5, NATO Headquarters, 1110 Brussels (1989).
17. R. Leese, A unified approach to the assignment of radio channels on a regular hexagonal grid, to appear.
18. R. Leese, A unified approach to problems in radio channel assignment, in: IMA Conf. on Applications of Combinatorial Mathematics, Oxford (1994), to appear.
19. J. Mycielski, Sur le coloriage des graphs, Colloq. Math. 3 (1955) 161-162.
20. R. Peeters, The frequency assignment problem as a weighted graph colouring problem, M.Sc. Thesis, Eindhoven University of Technology, 1991.
21. A. Raychaudhuri, Intersection assignments, T-colourings and powers of graphs, Ph.D. Thesis, Rutgers University, 1985.
22. F.S. Roberts, T-colorings of graphs: recent results and open problems, Discrete Math. 93 (1991) 229-245.
23. D.H. Smith, Graph colouring and frequency assignment, Ars Combin. 25C (1988) 205-212.
24. J.A. Zoellner and C.L. Beall, A breakthrough in spectrum conserving frequency assignment technology, IEEE Trans. on Electromagnetic Compatibility, EMC-19 (1977) 313-319.