Expected computation time for Hamiltonian path problem
SIAM Journal on Computing
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
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graph-Theoretic Concepts in Computer Science
Exact and Approximate Bandwidth
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distortion Is Fixed Parameter Tractable
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Exact and approximate bandwidth
Theoretical Computer Science
An exact algorithm for minimum distortion embedding
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
| Hi-index | 0.05 |
In this paper we merge recent developments on exact algorithms for finding an ordering of vertices of a given graph that minimizes bandwidth (the Bandwidth problem) and for finding an embedding of a given graph into a line that minimizes distortion (the Distortion problem). For both problems we develop algorithms that work in O(9.363^n) time and polynomial space. For Bandwidth, this improves O^*(10^n) algorithm by Feige and Kilian from 2000, for Distortion this is the first polynomial space exact algorithm that works in O(c^n) time we are aware of. As a byproduct, we enhance the O(5^n^+^o^(^n^))-time and O^*(2^n)-space algorithm for Distortion by Fomin et al. to an algorithm working in O(4.383^n)-time and space.