Some lower bounds for a class of frequency assignment problems
- 1 February 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 35 (1) , 8-14
- https://doi.org/10.1109/t-vt.1986.24063
Abstract
Lower bounds for the number of frequencies required by solutions of certain frequency assignment problems are derived. The bounds constitute generalizations of the clique number, which appears in the pure co-channel case, to problems including adjacent channel and co-site constraints as well as preassigned and blocked frequencies. Examples of mobile telephone systems are studied with the aid of these bounds.Keywords
This publication has 8 references indexed in Scilit:
- Homogeneous distribution of frequencies in a regular hexagonal cell systemIEEE Transactions on Vehicular Technology, 1982
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980
- Advanced Mobile Phone Service: The Cellular ConceptBell System Technical Journal, 1979
- A heuristic technique for assigning frequencies to mobile radio netsIEEE Transactions on Vehicular Technology, 1978
- A Breakthrough in Spectrum Conserving Frequency Assignment TechnologyIEEE Transactions on Electromagnetic Compatibility, 1977
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- A Simulation Study of Some Dynamic Channel Assignment Algorithms in a High Capacity Mobile Telecommunications SystemIEEE Transactions on Communications, 1973
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973