In a general combinatorial search problem with binary tests we are given a set of elements and a hypergraph of possible tests, and the goal is to find an unknown target element using a minimum number of tests. We explore the expected test number of randomized strategies. We obtain several general results on the ratio of the expected and worst-case deterministic test number, as well as complexity results for hypergraphs of small rank, and we state some open problems
Group testing (GT) was originally proposed during the World War II in an attempt to minimize the \em...
The quality of a heuristic solution to a NP-hard combinatorial problem is hard to assess. A few stud...
Group testing is a well known search problem that consists in detecting the defective members of a s...
In a general combinatorial search problem with binary tests we are given a set of elements and a hyp...
In a combinatorial search problem with binary tests, we are given a set of elements (vertices) and a...
In a combinatorial search problem we wish to identify an unknown element by binary tests, where the ...
For the well-established group testing problem, i.e., finding defective elements in a set by testing...
Suppose that we are given a set of n elements d of whichhave a property called defective. A group te...
Suppose that we are given a set of n elements d of which have a property called defective. A group t...
The classical group testing problem asks to determine at most d defective elements in a set of n ele...
The classical and well-studied group testing problem is to find d defectives in a set of n elements ...
Suppose that given is a collection of $n$ elements where $d$ of them are \emph{defective}. We can q...
This chapter compiles a number of results that apply the theory of parameterized algorithmics to the...
In the test cover problem a set of m items is given together with a collection of subsets, called t...
Cicalese F, Deppe C. Perfect minimally adaptive q-ary search with unreliable tests. JOURNAL OF STATI...
Group testing (GT) was originally proposed during the World War II in an attempt to minimize the \em...
The quality of a heuristic solution to a NP-hard combinatorial problem is hard to assess. A few stud...
Group testing is a well known search problem that consists in detecting the defective members of a s...
In a general combinatorial search problem with binary tests we are given a set of elements and a hyp...
In a combinatorial search problem with binary tests, we are given a set of elements (vertices) and a...
In a combinatorial search problem we wish to identify an unknown element by binary tests, where the ...
For the well-established group testing problem, i.e., finding defective elements in a set by testing...
Suppose that we are given a set of n elements d of whichhave a property called defective. A group te...
Suppose that we are given a set of n elements d of which have a property called defective. A group t...
The classical group testing problem asks to determine at most d defective elements in a set of n ele...
The classical and well-studied group testing problem is to find d defectives in a set of n elements ...
Suppose that given is a collection of $n$ elements where $d$ of them are \emph{defective}. We can q...
This chapter compiles a number of results that apply the theory of parameterized algorithmics to the...
In the test cover problem a set of m items is given together with a collection of subsets, called t...
Cicalese F, Deppe C. Perfect minimally adaptive q-ary search with unreliable tests. JOURNAL OF STATI...
Group testing (GT) was originally proposed during the World War II in an attempt to minimize the \em...
The quality of a heuristic solution to a NP-hard combinatorial problem is hard to assess. A few stud...
Group testing is a well known search problem that consists in detecting the defective members of a s...
DOI
Add to ORKG