Pages that link to "Item:Q3183480"
From MaRDI portal
The following pages link to Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480):
Displayed 5 items.
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)