Two new perspectives on multi-stage group testing

DOI10.1007/s00453-013-9781-4zbMath1311.68187OpenAlexW1995522343MaRDI QIDQ378258

Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch

Publication date: 11 November 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-013-9781-4

zbMATH Keywords

randomizationgroup testingtransversal matroidHuffman codeSperner familyparallel testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Randomized algorithms (68W20)

Related Items

Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing, An improved zig zag approach for competitive group testing, Smart elements in combinatorial group testing problems with more defectives, Strict group testing and the set basis problem, A class of asymptotically optimal group testing strategies to identify good items, Smart elements in combinatorial group testing problems, On optimal randomized group testing with one defective item and a constrained number of positive responses, Rounds in a combinatorial search problem, A class of asymptotically optimal group screening strategies with limited item participation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Overlaps help: Improved bounds for group testing with interval queries
• The minimal number of basic elements in a multiset antichain
• On the cut-off point for combinatorial group testing
• On the upper bound of the size of the \(r\)-cover-free families
• Optimal pooling designs with error detection
• Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
• When is Individual Testing Optimal for Nonadaptive Group Testing?
• Randomized Group Testing Both Query-Optimal and Minimal Adaptive
• Combinatorial Group Testing for Corruption Localizing Hashing
• A Canonical Form for Testing Boolean Function Properties
• A Sequential Method for Screening Experimental Variables
• Incomplete identification models for group-testable items
• Three theorems regarding testing graph properties
• Improved Results for Competitive Group Testing
• Group Testing With Random Pools: Optimal Two-Stage Algorithms
• Optimal Two-Stage Algorithms for Group Testing Problems
• Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
• A Method for the Construction of Minimum-Redundancy Codes
• A short proof of Sperner's lemma
• Matroids and the greedy algorithm
• Computational Science – ICCS 2005