Parameterized Study of the Test Cover Problem
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 283-295
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variablesJournal of Computer and System Sciences, 2012
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problemsTheoretical Computer Science, 2011
- A probabilistic approach to problems parameterized above or below tight boundsJournal of Computer and System Sciences, 2011
- Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal2011
- Solving MAX-r-SAT Above a Tight Lower BoundAlgorithmica, 2010
- Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above AverageLecture Notes in Computer Science, 2010
- On the Approximability of the Minimum Test Collection ProblemLecture Notes in Computer Science, 2001
- Parameterizing above Guaranteed Values: MaxSat and MaxCutJournal of Algorithms, 1999
- Parameterized Complexity1999
- Induced subsetsJournal of Combinatorial Theory, Series B, 1972