A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
From MaRDI portal
Publication:3608876
DOI10.1007/978-3-540-73545-8_51zbMath1176.68236MaRDI QIDQ3608876
Hong Zhu, Yong Zhang, 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
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
68W15: Distributed algorithms
68W27: Online algorithms; streaming algorithms
Related Items
Absolute and asymptotic bounds for online frequency allocation in cellular networks, Better bounds for incremental frequency allocation in bipartite graphs, Simpler multicoloring of triangle-free hexagonal graphs, Three results on frequency assignment in linear cellular networks, On modeling and analysis of MIMO wireless mesh networks with triangular overlay topology