A new competitive algorithm for the counterfeit coin problem
References (2)
- D.Z. Du and H. Park. On competitive group testing, SIAM J. Comput., to...
- et al.
A competitive algorithm for the counterfeit coin problem
(1992)
Cited by (11)
Optimal search procedure on coin-weighing problem
2006, Journal of Statistical Planning and InferenceSearching for two counterfeit coins with two-arms balance
2005, Discrete Applied MathematicsSearching for a counterfeit coin with two unreliable weighings
2005, Discrete Applied MathematicsCitation Excerpt :It would be interesting to generalize our result to other problems: more than one counterfeit coin (cf. [1,3,17,18,20,26,28–30]), group testing model (cf. [4,7,9–14]), spring scale instead of the two-arms balance scale (cf. [3]), multi-arms balance scale instead of the two-arms balance scale (cf. [5,6]), average case optimality instead of worst-case optimality (cf. [1,14,19]), non-adaptive search instead of adaptive search (cf. [1,5,10,14,19]), etc.
Randomized group testing for mutually obscuring defectives
1998, Information Processing LettersA 3/2 log 3-competitive algorithm for the counterfeit coin problem
1997, Theoretical Computer ScienceAnti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs
1997, Journal of Combinatorial Theory. Series A
Copyright © 1994 Published by Elsevier B.V.