Optimal deterministic group testing algorithms to estimate the number of defectives.
Nader H. BshoutyCatherine A. Haddad-ZaknoonPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- group testing
- disjoint sets
- memory requirements
- computational complexity
- randomized algorithm
- dynamic programming
- worst case
- computationally efficient
- learning algorithm
- orders of magnitude
- sufficiently small
- exhaustive search
- times faster
- computational efficiency
- theoretical analysis
- execution times
- objective function
- run times
- randomized algorithms
- lower bound
- binary search trees
- running times
- black box
- computational cost
- machine learning algorithms
- benchmark datasets
- multi objective
- greedy algorithm
- upper bound
- data structure
- optimal solution