The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete
SIAM Journal on Algebraic and Discrete Methods
Computing the bandwidth of interval graphs
SIAM Journal on Discrete Mathematics
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Complexity of the Approximation of the Bandwidth Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Volume Distortion for Subsets of Euclidean Spaces
Discrete & Computational Geometry
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Exact and approximate bandwidth
Theoretical Computer Science
Bandwidth and distortion revisited
Discrete Applied Mathematics
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
| Hi-index | 0.00 |
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*(10n)-time and polynomial space algorithm. In this article we present a new algorithm that solves Bandwidth in O*(5n) time and O*(2n) space. Then, we take a closer look and introduce a major modification that makes it run in O(4.83n) time with a cost of a O*(4n) 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.