Competitive group testing

From MaRDI portal
Publication:1309810

DOI10.1016/0166-218X(93)90011-CzbMath0784.90046MaRDI QIDQ1309810

Frank K. Hwang, Ding-Zhu Du

Publication date: 21 March 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

group testingdefective itemscanonical treegood items


Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Case-oriented studies in operations research (90B90)


Related Items

Improved algorithms for group testing with inhibitors ⋮ A group testing problem for graphs with several defective edges ⋮ A competitive algorithm in searching for many edges in a hypergraph ⋮ A Zig-Zag Approach for Competitive Group Testing ⋮ On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges ⋮ An improved zig zag approach for competitive group testing ⋮ Upper and lower bounds for competitive group testing ⋮ The \(K\)-server problem via a modern optimization lens ⋮ A new strongly competitive group testing algorithm with small sequentiality ⋮ Optimal strategies against a liar ⋮ A randomized competitive group testing procedure ⋮ An Efficient Algorithm for Combinatorial Group Testing ⋮ On searching strategies, parallel questions, and delayed answers ⋮ Efficient algorithms for chemical threshold testing problems ⋮ Least adaptive optimal search with unreliable tests ⋮ Existence theorems for some group testing strategies ⋮ Searching for an edge in a graph with restricted test sets ⋮ A revised algorithm for searching for all defective edges in a graph ⋮ Edge search in graphs with restricted test sets ⋮ A new randomized algorithm for group testing with unknown number of defective items



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1309810&oldid=13425607"
Powered by MediaWiki