Improved results for competitive group testing

Combinatorics Probability and Computing

Volumn 14, Issue 1-2, 2005, Pages 191-202

  Schlaghoff, Jens ^a   Triesch, Eberhard ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; INFORMATION THEORY; PATTERN RECOGNITION; PROBLEM SOLVING; STATISTICAL TESTS; THEOREM PROVING;

BLOOD SAMPLES; COMPETITIVE RATIO; DEFECTIVES; GROUP TESTING;

GROUP TECHNOLOGY;

EID: 14544301063     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006649     Document Type: Article

References (10)

1. Ahlswede, R. and Wegener, I. (1979) Suchprobleme, Teubner, Stuttgart.
2. Aigner, M. (1988) Combinatorial Search, Wiley-Teubner, Stuttgart and Chichester.
3. Bar-Noy, A., Hwang, F. K., Kessler, I. and Kutten, S. (1994) A new competitive algorithm for group testing. Discrete Appl. Math. 52 29-38.
4. Dorfman, R. (1943) The detection of defective members of large populations. Ann. Math. Statist. 14 436-440.
5. Du, D. Z. and Hwang, F. K. (1982) Minimizing a combinatorial function. SIAM J. Alg. Discrete Methods 3 523-529.
6. Du, D. Z. and Hwang, F. K. (1993) Competitive group testing. Discrete Appl. Math. 45 221-232.
7. Du, D. Z. and Hwang, F. K. (2000) Combinatorial Group Testing and its Applications, 2nd edn, World Scientific, Singapore.
8. Du, D. Z. and Park, H. (1994) On competitive group testing. SIAM J. Comput. 23 1019-1025.
9. Du, D. Z., Xue, G.-L., Sun, S.-Z. and Cheng, S.-W. (1994) Modifications of competitive group testing. SIAM J. Comput. 23 82-96.
10. Triesch, E. (1996) A group testing problem for hypergraphs of bounded rank. Discrete Appl. Math. 66 185-188.