The following pages link to (Q2721963):
Displaying 17 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Bandwidth and distortion revisited (Q412348) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- The online graph bandwidth problem (Q1198951) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Bandwidth contrained NP-complete problems (Q1822500) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- Approximating the bandwidth of caterpillars (Q2391175) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- Faster Exact Bandwidth (Q5302047) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
- Ordering transactions with bounded unfairness: definitions, complexity and constructions (Q6637324) (← links)