Pages that link to "Item:Q989534"
From MaRDI portal
The following pages link to Approximation of min coloring by moderately exponential algorithms (Q989534):
Displaying 13 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)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
