A fast constructive algorithm for fixed channel assignment problem
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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2001
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14165/1/14165_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14165/2/14165_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|