Multicoloring of cannonball graphs
Combinatorics
2016-01-17 v1
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 \jz{approximation} algorithms for multicoloring of so called cannonball graphs.
Keywords
Cite
@article{arxiv.1307.2688,
title = {Multicoloring of cannonball graphs},
author = {Petra Sparl and Rafal Witkowski and Janez Zerovnik},
journal= {arXiv preprint arXiv:1307.2688},
year = {2016}
}