5,032 research outputs found
Tight lower bound for the channel assignment problem
We study the complexity of the Channel Assignment problem. A major open
problem asks whether Channel Assignment admits an -time algorithm, for
a constant independent of the weights on the edges. We answer this question
in the negative i.e. we show that there is no -time algorithm
solving Channel Assignment unless the Exponential Time Hypothesis fails. Note
that the currently best known algorithm works in time so our lower bound is tight
- β¦