Pages that link to "Item:Q4634028"
From MaRDI portal
The following pages link to The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028):
Displaying 6 items.
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- The inapproximability of \(k\)-dominatingSet for parameterized \(\mathsf{{AC}^0}\) circuits (Q2327096) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- On the Parameterized Complexity of Approximating Dominating Set (Q5215462) (← links)