Even Faster Exact Bandwidth

Details Even Faster Exact Bandwidth Even Faster Exact Bandwidth

2009-02-10

arxiv.org/abs/0902.1661v1

Computer Science

Computational Complexity

Paper submitted to Transaction on Algorithms on 5th Nov 2008

Scientific paper

We deal with exact algorithms for Bandwidth, a long studied NP-hard problem. For a long time nothing better than the trivial O*(n!) exhaustive search was known. In 2000, Feige an Kilian came up with a O*(10^n)-time algorithm. Recently we presented algorithm that runs in O*(5^n) time and O*(2^n) space.. In this paper we present a major modification to our algorithm which makes it run in O(4.83^n) time with the cost of O*(4^n) space complexity. This modification allowed us to perform Measure & Conquer analysis for the time complexity which was not used for such types of problems before.

Affiliated with

Also associated with

No associations

Rating

Even Faster Exact Bandwidth 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 Even Faster Exact Bandwidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Even Faster Exact Bandwidth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-20104