2013/07/10 by Petra Sparl, Petra Šparl, Rafal Witkowski +6
Computer Science · Engineering · Mathematics · #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #graph theory and CDMA systems #math.CO #msc:05C15
paper · pdf · doi:10.48550/arxiv.1307.2688
arxiv created 2013/07/10 · openalex publication_date 2013/07/10 · arxiv updated 2016/01/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 \jzapproximation algorithms for multicoloring of so called cannonball graphs.