### Abstract

Many fault-detection problems fall into the following model: There is a set of n items, some of which are defective. The goal is to identify the defective items by using the minimum number of tests. Each test is on a subset of items and tells whether the subset contains a defective item or not. Let M_{alpha}(d,n)(M_{alpha}(d/ n)) denote the maximum number of tests for an algorithm α to identify d defectives from a set of n items provided that d, the number of defective items, is known (unknown) before the testing.

Original language | English (US) |
---|---|

Pages (from-to) | 82-96 |

Number of pages | 15 |

Journal | SIAM Journal on Computing |

Volume | 23 |

Issue number | 1 |

State | Published - Feb 1994 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Applied Mathematics
- Theoretical Computer Science

### Cite this

*SIAM Journal on Computing*,

*23*(1), 82-96.

**Modifications of competitive group testing.** / Du, D. Z.; Xue, Guoliang; Sun, S. N.; Cheng, S. W.

Research output: Contribution to journal › Article

*SIAM Journal on Computing*, vol. 23, no. 1, pp. 82-96.

}

TY - JOUR

T1 - Modifications of competitive group testing

AU - Du, D. Z.

AU - Xue, Guoliang

AU - Sun, S. N.

AU - Cheng, S. W.

PY - 1994/2

Y1 - 1994/2

N2 - Many fault-detection problems fall into the following model: There is a set of n items, some of which are defective. The goal is to identify the defective items by using the minimum number of tests. Each test is on a subset of items and tells whether the subset contains a defective item or not. Let Malpha(d,n)(Malpha(d/ n)) denote the maximum number of tests for an algorithm α to identify d defectives from a set of n items provided that d, the number of defective items, is known (unknown) before the testing.

AB - Many fault-detection problems fall into the following model: There is a set of n items, some of which are defective. The goal is to identify the defective items by using the minimum number of tests. Each test is on a subset of items and tells whether the subset contains a defective item or not. Let Malpha(d,n)(Malpha(d/ n)) denote the maximum number of tests for an algorithm α to identify d defectives from a set of n items provided that d, the number of defective items, is known (unknown) before the testing.

UR - http://www.scopus.com/inward/record.url?scp=0028381404&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028381404&partnerID=8YFLogxK

M3 - Article

VL - 23

SP - 82

EP - 96

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 1

ER -