{"paper":{"title":"Parameterized Study of the Test Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"A. Yeo, G. Gutin, M. Jones, R. Crowston, S. Saurabh","submitted_at":"2012-12-01T14:38:25Z","abstract_excerpt":"We carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the {\\sc Test Cover} problem we are given a set $[n]=\\{1,...,n\\}$ of items together with a collection, $\\cal T$, of distinct subsets of these items called tests. We assume that $\\cal T$ is a test cover, i.e., for each pair of items there is a test in $\\cal T$ containing exactly one of these items. The objective is to find a minimum size subcollection of $\\cal T$, which is still a test cover. The generic parameterized version of {\\sc Test Cove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0117","kind":"arxiv","version":1},"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"}