{"paper":{"title":"Parameterizations of Test Cover with Bounded Test Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Yeo, Gabriele Muciaccia, Gregory Gutin, Mark Jones, Robert Crowston","submitted_at":"2012-09-28T14:13:14Z","abstract_excerpt":"In the {\\sc Test Cover} problem we are given a hypergraph $H=(V, \\mathcal{E})$ with $|V|=n, |\\mathcal{E}|=m$, and we assume that $\\mathcal{E}$ is a test cover, i.e. for every pair of vertices $x_i, x_j$, there exists an edge $e \\in \\mathcal{E}$ such that $|{x_i,x_j}\\cap e|=1$. The objective is to find a minimum subset of $\\mathcal{E}$ which is a test cover. The problem is used for identification across many areas, and is NP-complete. From a parameterized complexity standpoint, many natural parameterizations of {\\sc Test Cover} are either $W[1]$-complete or have no polynomial kernel unless $coN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6528","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}