Journal article icon

Journal article

Channel assignment and weighted coloring.

Abstract:
In cellular telephone networks, sets of radio channels (colors) must be assigned to transmitters (vertices) while avoiding interference. Often, the transmitters are laid out like vertices of a triangular lattice in the plane. We investigated the corresponding weighted coloring problem of assigning sets of colors to vertices of the triangular lattice so that the sets of colors assigned to adjacent vertices are disjoint. We present a hardness result and an efficient algorithm yielding an approximate solution. © 2000 John Wiley and Sons, Inc.
Publication status:
Published

Actions


Access Document


Authors


Journal:
Networks
Volume:
36
Issue:
2
Pages:
114-117
Publication date:
2000-01-01
DOI:
EISSN:
1097-0037
ISSN:
0028-3045
URN:
uuid:2991d798-7fa1-47bb-bf68-f8b41d83e524
Source identifiers:
102311
Local pid:
pubs:102311

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP