On the Parameterized Complexity of Approximating Dominating Set
STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 2018, pp. 1-38, 2019.
Parameterized inapproximabilitydominating setset cover
We study the parameterized complexity of approximating the k-Dominating Set (DomSet) problem where an integer k and a graph G on n vertices are given as input, and the goal is to find a dominating set of size at most F(k) ⋅ k whenever the graph G has a dominating set of size k. When such an algorithm runs in time T(k) ⋅ poly (n) (i.e., FP...More
Full Text (Upload PDF)
PPT (Upload PPT)