Pages that link to "Item:Q989534"
From MaRDI portal
The following pages link to Approximation of min coloring by moderately exponential algorithms (Q989534):
Displaying 6 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)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
