Multicoloring of cannonball graphs
DOI:
https://doi.org/10.26493/1855-3974.528.751Keywords:
Graph coloring, approximation algorithm, frequency planning, cellular networks.Abstract
The frequency allocation problem that appeared in the design of cellular telephone networks can be regarded as a multicoloring problem on a weighted hexagonal graph, which opened some still interesting mathematical problems. We generalize the multicoloring problem into higher dimension and present the first approximation algorithms for multicoloring of the so called cannonball graphs.Downloads
Published
2015-03-03
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/