Channel assignment via fast zeta transform

Authors:
Marek Cygan;Łukasz Kowalik
Affiliations:
Institute of Informatics, University of Warsaw, Poland;Institute of Informatics, University of Warsaw, Poland
Venue:
Information Processing Letters
Year:
2011

Citing 6
Cited 3

On the span in channel assignment problems: bounds, computing and counting

Discrete Mathematics - Special issue: The 18th British combinatorial conference
Set Partitioning via Inclusion-Exclusion

SIAM Journal on Computing
An exact algorithm for the channel assignment problem

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
The time complexity of constraint satisfaction

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact Algorithms for L(2,1)-Labeling of Graphs

Algorithmica
On improved exact algorithms for L(2, 1)-labeling of graphs

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms

Determining the l(2,1)-span in polynomial space

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Determining the L(2,1)-span in polynomial space

Discrete Applied Mathematics
Fast exact algorithm for L(2,1)-labeling of graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show an O^@?((@?+1)^n)-time algorithm for the channel assignment problem, where @? is the maximum edge weight. This improves on the previous O^@?((@?+2)^n)-time algorithm by Kral (2005) [1], as well as algorithms for important special cases, like L(2,1)-labeling. 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.