Parameterized Study of the Test Cover Problem
From MaRDI portal
Publication:2912727
DOI10.1007/978-3-642-32589-2_27zbMath1365.68275arXiv1212.0117OpenAlexW79226865MaRDI QIDQ2912727
No author found.
Publication date: 25 September 2012
Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.0117
Related Items (10)
Deterministic versus randomized adaptive test cover ⋮ Randomized Adaptive Test Cover ⋮ Combinatorial search in two and more rounds ⋮ System of unbiased representatives for a collection of bicolorings ⋮ Fixed-parameter tractable algorithms for tracking shortest paths ⋮ Parameterized and approximation complexity of \textsc{Partial VC Dimension} ⋮ Induced-bisecting families of bicolorings for hypergraphs ⋮ Partially Polynomial Kernels for Set Cover and Test Cover ⋮ Alternative parameterizations of \textsc{Metric Dimension} ⋮ Parameterizations of test cover with bounded test sizes
This page was built for publication: Parameterized Study of the Test Cover Problem
