COMPETITIVE GROUP-TESTING

被引：11
|
作者：
DU, DZ
HWANG, FK
机构：
[1] AT&T BELL LABS,MATH SCI RES CTR,600 MTN AVE,MURRAY HILL,NJ 07974
[2] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544
[3] CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
来源：
DISCRETE APPLIED MATHEMATICS | 1993年 / 45卷 / 03期
关键词：
D O I：
10.1016/0166-218X(93)90011-C
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let M(A)(n,d) denote the maximum number of group tests for a group testing algorithm A to identify d defectives from a set of n items when d is known, and let M(A)(n\d) denote the number when d is unknown. Define M(n,d) = min(A) M(A)(n,d). An algorithm A is called a competitive algorithm if there exist constants c and a such that for all n > d greater-than-or-equal-to 0, M(A)(n\d) less-than-or-equal-to cM(n,d) + a. In this paper, we present some competitive group testing algorithms.
引用
收藏
页码：221 / 232
页数：12
相关论文
共 50 条
12345