炮弹图的多重着色
Multicoloring of cannonball graphs
摘要:
蜂窝电话网络设计中出现的频率分配问题可以看作是一个加权六边形图上的多色问题,它揭示了一些仍然有趣的数学问题。我们将多色问题推广到高维,并提出了第一个\jz{approximation}算法的所谓的炮弹图的多色。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。