1-local 17/12-competitive algorithm for multicoloring hexagonal graphs

Authors:
Rafał Witkowski
Affiliations:
Adam Mickiewicz University, Faculty of Mathematics and Computer Science, Poznań, Poland
Venue:
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Year:
2009

Citing 6
Cited 1

Distributed online frequency assignment in cellular networks

Journal of Algorithms
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice

Discrete Mathematics
Channel assignment and graph multicoloring

Handbook of wireless networks and mobile computing
2-Local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs

Information Processing Letters
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs

Journal of Algorithms
A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

1-local 33/24-competitive algorithm for multicoloring hexagonal graphs

WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the frequency allocation problem we are given a cellular tephone network whose geographical coverage area is divided into cells where phone calls are serviced by frequencies assigned to them, 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 used frequencies. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph. In this paper we present a 1-local 17/12-competitive distributed algorithm for a multicoloring of hexagonal graph, thereby improving the competitiveness ratio of previously known best 1-local 13/9-competitive algorithm (see [1]).