Channel Assignment via Fast Zeta Transform
Data Structures and Algorithms
2011-03-14 v1
Abstract
We show an O*((l+1)^n)-time algorithm for the channel assignment problem, where l is the maximum edge weight. This improves on the previous O*((l+2)^n)-time algorithm by Kral, as well as algorithms for important special cases, like L(2,1)-labelling. For the latter problem, our algorithm works in O*(3^n) time. The progress is achieved by applying the fast zeta transform in combination with the inclusion-exclusion principle.
Cite
@article{arxiv.1103.2275,
title = {Channel Assignment via Fast Zeta Transform},
author = {Marek Cygan and Łukasz Kowalik},
journal= {arXiv preprint arXiv:1103.2275},
year = {2011}
}
Comments
6 pages