Deterministic versus randomized adaptive test cover
type: Item
instance of: scholarly article
title: Deterministic versus randomized adaptive test cover
zbMATH Open document ID: 1353.68257
author: Peter Damaschke
published in: Theoretical Computer Science
publication date: 2016-10-21T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C72
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6642439
zbMATH Keywords: combinatorial search
zbMATH Keywords: randomization
zbMATH Keywords: game theory
zbMATH Keywords: LP duality
zbMATH Keywords: set cover
zbMATH Keywords: fractional graph theory
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.09.019
OpenAlex ID: W2528667811
cites work: Partially Polynomial Kernels for Set Cover and Test Cover
cites work: Approximation algorithms for the test cover problem
cites work: Q4411361
cites work: A new randomized algorithm for group testing with unknown number of defective items
cites work: Group Testing With Probabilistic Tests: Theory, Design and Application
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Parameterizations of test cover with bounded test sizes
cites work: Parameterized Study of the Test Cover Problem
cites work: A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
cites work: Q4010313
cites work: Paths, Trees, and Flowers
cites work: Q3507769
cites work: A Parameterized Perspective on Packing Paths of Length Two
cites work: (Non-)existence of polynomial kernels for the test cover problem
cites work: Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
cites work: Group Testing With Random Pools: Optimal Two-Stage Algorithms
cites work: Q4382863
cites work: Non-approximability results for optimization problems on bounded degree instances
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Rounds in combinatorial search
DOI: 10.1016/J.TCS.2016.09.019
Recommended article: Randomized Adaptive Test Cover
Recommended article: Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
Recommended article: Hybrid adaptive random testing
Recommended article: Q5421864
Recommended article: Parameterizations of test cover with bounded test sizes
description: scientific article; zbMATH DE number 6642439