A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs

DOI10.1016/J.DAM.2011.12.013zbMath1321.05094OpenAlexW2041801390MaRDI QIDQ496697

Rafał Witkowski

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.013

zbMATH Keywords

algorithmmulticoloringfrequency assignment problemFAPhexagonal graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Cites Work

• 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
• Distributed Online Frequency Assignment in Cellular Networks
• Channel assignment and weighted coloring
• 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs
• 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
• Static frequency assignment in cellular networks

This page was built for publication: A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs