A NOTE ON THE HU-HWANG-WANG CONJECTURE FOR GROUP TESTING

被引:1
作者
Leu, Ming-Guang [1 ]
机构
[1] Natl Cent Univ, Dept Math, Chungli 32054, Taiwan
关键词
group testing; algorithm;
D O I
10.1017/S1446181108000175
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Hu et al. ["A boundary problem for group testing". SIAM J. Algebraic Discrete Meth. 2 (1981), 81-87] conjectured that the minimax test number to find d defectives in 3d items is 3d - 1, a surprisingly difficult combinatorial problem about which very little is known. In this article we state three more conjectures and prove that they are all equivalent to the conjecture of Hu et al. Notably, as a byproduct, we also obtain an interesting upper bound for M(d.n).
引用
收藏
页码:561 / 571
页数:11
相关论文
共 15 条
[1]  
Ahlswede R., 1987, Search Problems
[2]  
AIGNER M, 1988, COMBINATORIAL SEARCH
[3]  
Aslam Javed A, 1991, P 23 ANN ACM S THEOR, P486, DOI 10.1145/103418.103469
[4]   A NEW COMPETITIVE ALGORITHM FOR GROUP-TESTING [J].
BARNOY, A ;
HWANG, FK ;
KESSLER, I ;
KUTTEN, S .
DISCRETE APPLIED MATHEMATICS, 1994, 52 (01) :29-38
[5]   A GROUP-TESTING PROBLEM [J].
CHANG, GJ ;
HWANG, FK .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (01) :21-24
[6]   A GROUP-TESTING PROBLEM ON 2 DISJOINT SETS [J].
CHANG, GJ ;
HWANG, FK .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (01) :35-38
[7]   A TIGHT UPPER BOUND FOR GROUP-TESTING IN GRAPHS [J].
DAMASCHKE, P .
DISCRETE APPLIED MATHEMATICS, 1994, 48 (02) :101-109
[8]  
Du D.Z., 1982, SIAM J ALG DISC METH, V3, P523
[9]  
Du D.-Z., 2000, COMBINATORIAL GROUP
[10]   On the cut-off point for combinatorial group testing [J].
Fischer, P ;
Klasner, N ;
Wegener, I .
DISCRETE APPLIED MATHEMATICS, 1999, 91 (1-3) :83-92