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.

Cited by: 0|Bibtex|Views2|Links
Keywords:
Parameterized InapproximabilityDominating SetSet Cover

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments