By Topic

A new competitive algorithm for group testing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bar-Noy, A. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Hwang, F.K. ; Kessler, I. ; Kutten, S.

Algorithms for the group testing problem when there is no a priori information on the number of defective items are considered. The efficiency criterion used in the competitive ratio, which is the ratio of the number of tests required by an algorithm when there is no a priori information on the number of defective items, to the number of tests required by an optimal algorithm when the number of defective items is known in advance. A new algorithm is presented, and it is shown that the competitive ratio of this algorithm is 2. This result is an improvement over an algorithm given by D.Z. Du et al. (1991), for which the competitive ratio was 2.75. It also proves a conjecture made by them. A new application of group testing techniques for high-speed networks is discussed

Published in:

INFOCOM '92. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE

Date of Conference:

4-8 May 1992