Pages that link to "Item:Q1785218"
From MaRDI portal
The following pages link to Parameterized (in)approximability of subset problems (Q1785218):
Displaying 7 items.
- Subexponential parameterized algorithms (Q458457) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Inapproximability results for set splitting and satisfiability problems with no mixed clauses (Q1879246) (← links)
- Computability of width of submodular partition functions (Q1933647) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- On Parameterized Approximability (Q3499729) (← links)
