Tight lower bound for the channel assignment problem

DOI10.1137/1.9781611973730.45zbMath1371.68217arXiv1407.7162OpenAlexW4236979639MaRDI QIDQ5363091

Arkadiusz Socała

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7162

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Assigning channels via the meet-in-the-middle approach ⋮ On the Fine-Grained Complexity of Rainbow Coloring

This page was built for publication: Tight lower bound for the channel assignment problem