Pages that link to "Item:Q867860"
From MaRDI portal
The following pages link to Polynomial time approximation schemes and parameterized complexity (Q867860):
Displaying 7 items.
- Structure of polynomial-time approximation (Q692893) (← links)
- A problem reduction based approach to discrete optimization algorithm design (Q975314) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Scheduling two-stage jobs on multiple flowshops (Q2419124) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
