Pages that link to "Item:Q975529"

The following pages link to Parameterized approximation of dominating set problems (Q975529):

Displaying 27 items.

• Exponential approximation schemata for some network design problems (Q396669) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
• Structural parameterizations of dominating set variants (Q1625157) (← links)
• Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
• Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
• Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
• The inapproximability of \(k\)-dominatingSet for parameterized \(\mathsf{{AC}^0}\) circuits (Q2327096) (← 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)
• (Q2721971) (← 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)
• New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075) (← links)
• Approximation algorithms for connected dominating sets (Q4595486) (← links)
• The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
• (Q4680214) (← links)
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
• On the Parameterized Complexity of Approximating Dominating Set (Q5215462) (← links)
• Perfect domination and small cycles (Q5367522) (← links)
• Computing and Combinatorics (Q5716997) (← links)
• Parameterized Complexity of Generalized Domination Problems (Q5851100) (← links)
• Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)