Tight Lower Bound for the Channel Assignment Problem

DOI10.1145/2876505zbMath1445.68177OpenAlexW1533624370MaRDI QIDQ4962622

Arkadiusz Socała

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2876505

zbMATH Keywords

lower boundschannel assignmentexponential time hypothesis

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)

This page was built for publication: Tight Lower Bound for the Channel Assignment Problem