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.
Recommendations
- A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
- 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs
- A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
- 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
- 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Cited in
(3)
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)