Pages that link to "Item:Q2391175"
From MaRDI portal
The following pages link to Approximating the bandwidth of caterpillars (Q2391175):
Displaying 12 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Graph bandwidth of weighted caterpillars (Q860873) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete (Q3026359) (← links)
- Rollercoasters and Caterpillars (Q5002684) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479359) (← links)
- Algorithmic Applications in Management (Q5710139) (← links)