Smart elements in combinatorial group testing problems with more defectives

DOI10.26493/2590-9770.1363.B06MaRDI QIDQ5121559zbMATH OpenOpenAlexFDO

Authors Dániel Gerbner, Máté Vizer

Publication date 15 September 2020

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cancellative elementscombinatorial group testingdefective elements

Mathematics Subject Classification ID

Theory of questionnaires (94A50)

Abstract: In combinatorial group testing problems Questioner needs to find a defective element $xin[n]$ by testing subsets of $[n]$. In [18] the authors introduced a new model, where each element knows the answer for those queries that contain it and each element should be able to identify the defective one. In this article we continue to investigate this kind of models with more defective elements. We also consider related models inspired by secret sharing models, where the elements should share information among them to find out the defectives. Finally the adaptive versions of the different models are also investigated.

Recommendations

• Smart elements in combinatorial group testing problems
• Optimal deterministic group testing algorithms to estimate the number of defectives
• Optimal deterministic group testing algorithms to estimate the number of defectives
• scientific article; zbMATH DE number 823957
• Algorithms and Data Structures
• scientific article; zbMATH DE number 6530141
• Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
• Detecting deficiencies: an optimal group testing algorithm
• scientific article; zbMATH DE number 7759286
• A new randomized algorithm for group testing with unknown number of defective items

Cites work

• Combinatorial pair testing: distinguishing workers from slackers
• Families of finite sets in which no intersection of sets is covered by the union of s others
• scientific article; zbMATH DE number 3161569 (Why is no real title available?)
• scientific article; zbMATH DE number 4043100 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 3801449 (Why is no real title available?)
• Identifying defective sets using queries of small size
• Minimal completely separating systems
• Nonrandom binary superimposed codes
• On a problem concerning separating systems of a finite set
• On regular hypergraphs of high girth
• On the upper bound of the size of the \(r\)-cover-free families
• Optimal Two-Stage Algorithms for Group Testing Problems
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Rounds in a combinatorial search problem
• Secret-Sharing Schemes: A Survey
• Smart elements in combinatorial group testing problems
• Some new bounds for cover-free families
• Two new perspectives on multi-stage group testing
• Union-free hypergraphs and probability theory

Cited in

(2)

• Adaptive search for one defective in the additive group testing model
• Smart elements in combinatorial group testing problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121559)