The following pages link to Bandwidth and distortion revisited (Q412348):
Displaying 8 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- On the minimum eccentricity shortest path problem (Q2404081) (← links)
- Approximating the bandwidth via volume respecting embeddings (extended abstract) (Q4542524) (← links)
- (Q4733889) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)