On the Parameterized Complexity of Approximating Dominating Set
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, pp. 1283-1296, 2018.
Parameterized InapproximabilityDominating SetSet Cover
We study the parameterized complexity of approximating the k-Dominating Set (DomSet) m Set) 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....More
Full Text (Upload PDF)
PPT (Upload PPT)