Abstract
We deal with exact algorithms for
Bandwidth
, a long studied NP-hard problem. For a long time nothing better than the trivial
O
*
(
n
!)
1
exhaustive search was known. In 2000, Feige and Kilian [Feige 2000] came up with a
O
*
(10
n
)-time and polynomial space algorithm.
In this article we present a new algorithm that solves
Bandwidth
in
O
*
(5
n
) time and
O
*
(2
n
) space. Then, we take a closer look and introduce a major modification that makes it run in
O
(4.83
n
) time with a cost of a
O
*
(4
n
) space complexity. This modification allowed us to perform the Measure & Conquer analysis for the time complexity which was not used for graph layout problems before.
Funder
Polish Ministry of Science and Higher Education
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献