Pages that link to "Item:Q3656860"
From MaRDI portal
The following pages link to An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860):
Displaying 11 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
