1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs

Abstract

In the frequency allocation problem, we are given a cellular telephone network whose geographical coverage area is divided into cells, where phone calls are serviced by assigned frequencies, so that none of the pairs of calls emanating from the same or neighboring cells is assigned the same frequency. The problem is to use the frequencies efficiently, i.e. minimize the span of frequencies used. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph, where each vertex knows its position in the graph. We present a 1-local 33/24-competitive distributed algorithm for multicoloring a hexagonal graph, thereby improving the previous 1-local 7/5-competitive algorithm.
Fichier principal
Vignette du fichier
2147-8428-1-PB.pdf (373.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00966383 , version 1 (26-03-2014)

Identifiers

Cite

Rafal Witkowski, Janez Žerovnik. 1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 3 (3), pp.127-138. ⟨10.46298/dmtcs.614⟩. ⟨hal-00966383⟩

Collections

TDS-MACS
57 View
809 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More