PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

1-local 7/5-competitive algorithm for multicoloring hexagonal graphs.
Rafal witkowski and Janez Žerovnik
In: ISCO 2010 - International Symposium on Combinatorial Optimization, 24-26 March, 2010, Hammamet, Tunisia.

Abstract

Hexagonal graphs are graphs induced on subsets of vertices of triangular lattice. They arise naturally in studies of cellular networks. We present a 1-local 7/5-competitive distributed algorithm for multicoloring a hexagonal graph, thereby improving the previous 1-local 17/12-competitive algorithm.

EPrint Type:Conference or Workshop Item (Talk)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:7090
Deposited By:Igor Pesek
Deposited On:01 March 2011