Publication at Faculty of Mathematics and Physics |
2005
Abstract
We improve the running time of the currently best known exact algorithm for the channel assignment to $O(n(l+2)^n)$ for problems with maximum edge-weight $l$.
We improve the running time of the currently best known exact algorithm for the channel assignment to $O(n(l+2)^n)$ for problems with maximum edge-weight $l$.