A fast constructive algorithm for fixed channel assignment problem
Published • Nov 13, 2002
NobleIDNI8P37W33R61S68
Authors:,,
J.A. Khan
Sadiq M. Sait
S. Khan
Abstract
With limited frequency spectrum and an increasing demand for mobile communication services, the problem of channel assignment becomes increasingly important. It has been shown that this problem is equivalent to the graph-coloring problem, which is an NP-hard problem. In this work, a fast constructiv...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!