Application of the Graph Coloring Algorithm to the Frequency Assignment Problem

@inproceedings{Park1996ApplicationOT,
  title={Application of the Graph Coloring Algorithm to the Frequency Assignment Problem},
  author={Taehoon Park and Chae Y. Lee},
  year={1996}
}
The frequency assignment problem is introduced and solved with efficient heuristics. The problem is to assign channels to transmitters using the smallest span of frequency band while satisfying the requested communication qua,lity. A solution procedure which is based on Kernighan-Lin's two way uniform pa.rtitioning procedure is developed for the k-coloring problem. The k-coloring algorithm is modified to solve the frequency assignment problem. The performance of the proposed algorithm is tested… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS