Smart elements in combinatorial group testing problems

DOI10.1007/s10878-018-0248-zzbMath1401.90188arXiv1703.05398OpenAlexW2787820695MaRDI QIDQ1752611

Dániel Gerbner, Máté Vizer

Publication date: 24 May 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.05398

zbMATH Keywords

information sharingcombinatorial group testingnon-adaptive

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Smart elements in combinatorial group testing problems with more defectives ⋮ Majority problems of large query size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two new perspectives on multi-stage group testing
• Union-free hypergraphs and probability theory
• A note on tilted Sperner families with patterns
• Combinatorial Pair Testing: Distinguishing Workers from Slackers
• Secret-Sharing Schemes: A Survey
• Some Remarks on the Triple Systems of Steiner.
• New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
• Density-Based Group Testing
• Smart elements in combinatorial group testing problems with more defectives
• Group Testing With Probabilistic Tests: Theory, Design and Application
• Threshold Group Testing
• Minimal completely separating systems
• On a problem concerning separating systems of a finite set
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS

This page was built for publication: Smart elements in combinatorial group testing problems