Multicoloring of cannonball graphs
Šparl, Petra ; Witkowski, Rafał ; Žerovnik, Janez
ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015), / Harvested from ARS MATHEMATICA CONTEMPORANEA
link
link
link

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.

Publié le : 2015-01-01
DOI : https://doi.org/10.26493/1855-3974.528.751 
@article{528,
     title = {Multicoloring of cannonball graphs},
     journal = {ARS MATHEMATICA CONTEMPORANEA},
     volume = {11},
     year = {2015},
     doi = {10.26493/1855-3974.528.751},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/528}
}

Šparl, Petra; Witkowski, Rafał; Žerovnik, Janez. Multicoloring of cannonball graphs. ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015) . doi : 10.26493/1855-3974.528.751. http://gdmltest.u-ga.fr/item/528/