Computer Science – Computational Complexity
Scientific paper
2012-04-19
Computer Science
Computational Complexity
Scientific paper
The input of the Test Cover problem consists of a set $V$ of vertices, and a collection ${\cal E}=\{E_1,..., E_m\}$ of distinct subsets of $V$, called tests. A test $E_q$ separates a pair $v_i,v_j$ of vertices if $|\{v_i,v_j\}\cap E_q|=1.$ A subcollection ${\cal T}\subseteq {\cal E}$ is a test cover if each pair $v_i,v_j$ of distinct vertices is separated by a test in ${\cal T}$. The objective is to find a test cover of minimum cardinality, if one exists. This problem is NP-hard. We consider two parameterizations the Test Cover problem with parameter $k$: (a) decide whether there is a test cover with at most $k$ tests, (b) decide whether there is a test cover with at most $|V|-k$ tests. Both parameterizations are known to be fixed-parameter tractable. We prove that none have a polynomial size kernel unless $NP\subseteq coNP/poly$. Our proofs use the cross-composition method recently introduced by Bodlaender et al. (2011) and parametric duality introduced by Chen et al. (2005). The result for the parameterization (a) was an open problem (private communications with Henning Fernau and Jiong Guo, Jan.-Feb. 2012). We also show that the parameterization (a) admits a polynomial size kernel if the size of each test is upper-bounded by a constant.
Gutin Gregory
Muciaccia G.
Yeo Anders
No associations
LandOfFree
(Non-)existence of Polynomial Kernels for the Test Cover Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with (Non-)existence of Polynomial Kernels for the Test Cover Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and (Non-)existence of Polynomial Kernels for the Test Cover Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-35104