Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Cuts, Trees and ℓ1-Embeddings of Graphs*
Combinatorica
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Low-distortion embeddings of general metrics into the line
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for embedding general metrics into trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Graph-Theoretic Concepts in Computer Science
Distortion Is Fixed Parameter Tractable
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
An Exact Algorithm for Minimum Distortion Embedding
Graph-Theoretic Concepts in Computer Science
Exact and approximate bandwidth
Theoretical Computer Science
Bandwidth and distortion revisited
Discrete Applied Mathematics
| Hi-index | 5.23 |
Let G be an unweighted connected graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5^n^+^o^(^n^). This is the first algorithm breaking the trivial n!-barrier.