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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/hal-00966383
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 26, 2014 - 3:16:33 PM
Last modification on : Friday, March 15, 2019 - 4:55:06 PM
Document(s) archivé(s) le : Thursday, June 26, 2014 - 11:32:22 AM

File

2147-8428-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00966383, version 1

Collections

Citation

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

Share

Metrics

Record views

278

Files downloads

406