Channel Assignment via Fast Zeta Transform

Details Channel Assignment via Fast Zeta Transform Channel Assignment via Fast Zeta Transform

2011-03-11

arxiv.org/abs/1103.2275v1

Computer Science

Data Structures and Algorithms

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Channel Assignment via Fast Zeta Transform does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Channel Assignment via Fast Zeta Transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Channel Assignment via Fast Zeta Transform will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-430431