Pages that link to "Item:Q975529"
From MaRDI portal
The following pages link to Parameterized approximation of dominating set problems (Q975529):
Displaying 15 items.
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries (Q3087620) (← links)
- The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Perfect domination and small cycles (Q5367522) (← links)