Pages that link to "Item:Q5215462"
From MaRDI portal
The following pages link to On the Parameterized Complexity of Approximating Dominating Set (Q5215462):
Displaying 24 items.
- A decidability result for the dominating set problem (Q410736) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Parameterized approximation of dominating set problems (Q975529) (← links)
- Structural parameterizations of dominating set variants (Q1625157) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- The inapproximability of \(k\)-dominatingSet for parameterized \(\mathsf{{AC}^0}\) circuits (Q2327096) (← links)
- On the complexity of Mixed Dominating Set (Q2330564) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
- Approximation algorithms for connected dominating sets (Q4595486) (← links)
- (Q4680214) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
- Parameterized Complexity of Generalized Domination Problems (Q5851100) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Approximation Algorithms and Hardness for Domination with Propagation (Q5901134) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- A note on hardness of computing recursive teaching dimension (Q6072213) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6124592) (← links)
- How to find a good explanation for clustering? (Q6136087) (← links)
- Tight FPT approximation for socially fair clustering (Q6161442) (← links)
- \(k\)-median/means with outliers revisited: a simple fpt approximation (Q6591646) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)