Multicoloring of cannonball graphs

From MaRDI portal



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.











This page was built for publication: Multicoloring of cannonball graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810379)