Recommendations
Cites work
- scientific article; zbMATH DE number 1617243 (Why is no real title available?)
- An exact algorithm for minimum distortion embedding
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
- Distortion Is Fixed Parameter Tractable
- Even faster exact bandwidth
- Exact and Approximate Bandwidth
- Exact and approximate bandwidth
- Expected Computation Time for Hamiltonian Path problem
- Faster Exact Bandwidth
Cited in
(10)- An exponential time 2-approximation algorithm for bandwidth
- scientific article; zbMATH DE number 4120213 (Why is no real title available?)
- An exact algorithm for minimum distortion embedding
- Slightly superexponential parameterized problems
- Even faster exact bandwidth
- On the minimum eccentricity shortest path problem
- Tractabilities and intractabilities on geometric intersection graphs
- Line-distortion, bandwidth and path-length of a graph
- scientific article; zbMATH DE number 1775392 (Why is no real title available?)
- Line-distortion, bandwidth and path-length of a graph
This page was built for publication: Bandwidth and distortion revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412348)