A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs

DOI10.1007/978-3-540-73545-8_51MaRDI QIDQ3608876zbMATH OpenOpenAlexFDO

Authors Yong Zhang, Hong Zhu, Francis Y. L. Chin

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_51

zbMATH Keywords

online algorithmmulticoloringhexagonal graphs

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Distributed algorithms (68W15)

Recommendations

• A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
• 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
• A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
• 1-local 33/24-competitive algorithm for multicoloring hexagonal graphs
• 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
• 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
• \(1\)-local \(7/5\)-competitive algorithm for multicoloring hexagonal graphs
• 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
• 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs

Cited in

(16)

• 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
• Three results on frequency assignment in linear cellular networks
• A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
• A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
• Better bounds for incremental frequency allocation in bipartite graphs
• \(1\)-local \(7/5\)-competitive algorithm for multicoloring hexagonal graphs
• Multicoloring of cannonball graphs
• Absolute and asymptotic bounds for online frequency allocation in cellular networks
• 1-local 33/24-competitive algorithm for multicoloring hexagonal graphs
• 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
• 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
• 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
• Simpler multicoloring of triangle-free hexagonal graphs
• A distributed \(6/5\)-competitive algorithm for multicoloring triangle-free hexagonal graphs
• On modeling and analysis of MIMO wireless mesh networks with triangular overlay topology
• 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs

This page was built for publication: A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608876)