Abstract
The problem of assigning radio frequencies to a set of transmitters in a region is related to the theory of vertex colourings of graphs. Real frequency assignment problems often deal with a large number of transmitters. Exact methods of solution may be impracticable and heuristic methods must be used. Lower bounds for the frequency assignment problem can be used to assess the performance of these heuristic methods. In this paper, we present and assess a number of lower bounds. Methods of reducing the size of the problem before application of the heuristic methods are also described.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
