Pages that link to "Item:Q1362338"
From MaRDI portal
The following pages link to On fixed-parameter tractability and approximability of NP optimization problems (Q1362338):
Displaying 22 items.
- Structure of polynomial-time approximation (Q692893) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Capital Budgeting Problems: A Parameterized Point of View (Q2806927) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- The complexity of speedrunning video games (Q3301017) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- (Q4993600) (← links)
- A fixed-parameter-tractable algorithm for set packing (Q5957983) (← links)
