Skip to main content

Advertisement

Log in

An efficient FPRAS type group testing procedure to approximate the number of defectives

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In many fault detection problems, we want to detect or identify defective items in a sample set by using the minimum number of tests. Group testing is for the scenario where each test is on a subset of items, and tells whether the subset contains at least one defective item or not. Another practically important problem is to estimate the number of defective items in a sample set. In this paper, we present an efficient FPRAS (fully polynomial-time randomized approximation scheme) type group testing procedure to approximate the number of defective items in a sample set.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Alon N, Matias Y, Szegedy M (1999) The space complexity of approximating the frequency moments. J Comput Syst Sci 58(1):137–147

    Article  MATH  MathSciNet  Google Scholar 

  • Cheng Y (2011) An efficient randomized group testing procedure to determine the number of defectives. Oper Res Lett 39(5):352–354

    MATH  MathSciNet  Google Scholar 

  • Cormode G, Muthukrishnan S (2005) What’s hot and what’s not: tracking most frequent items dynamically. ACM Trans Database Syst 30(1):249–278

    Article  MathSciNet  Google Scholar 

  • Damaschke P, Sheikh Muhammad A (2010a) Competitive group testing and learning hidden vertex covers with minimum adaptivity. Discrete Math Algorithms Appl 2(3):291–311

    Article  MATH  MathSciNet  Google Scholar 

  • Damaschke P, Sheikh Muhammad A (2010b) Bounds for nonadaptive group tests to estimate the amount of defectives. In: Proc 4th international conference on combinatorial optimization and applications. Lecture notes in computer science, vol 6509, pp 117–130

    Chapter  Google Scholar 

  • Dorfman R (1943) The detection of defective members of large populations. Ann Math Stat 14:436–440

    Article  Google Scholar 

  • Du DZ, Hwang FK (2000) Combinatorial group testing and its applications, 2nd edn. World Scientific, Singapore

    MATH  Google Scholar 

  • Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58(301):13–30

    Article  MATH  MathSciNet  Google Scholar 

  • Li CH (1962) A sequential method for screening experimental variables. J Am Stat Assoc 57:455–477

    Article  MATH  Google Scholar 

  • Sobel M, Groll PA (1959) Group testing to eliminate efficiently all defectives in a binomial sample. Bell Syst Tech J 38:1179–1252

    Article  MathSciNet  Google Scholar 

  • Wein LM, Zenios SA (1996) Pooled testing for hiv screening: capturing the dilution effect. Oper Res 44(4):543–569

    Article  MATH  Google Scholar 

  • Wolf J (1985) Born again group testing: Multiaccess communications. IEEE Trans Inf Theory IT-31:185–191

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for their helpful comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yongxi Cheng.

Additional information

This work was partially supported by the National Natural Science Foundation of China under Grant Nos. 11101326, 71071123, 60921003, and the Program for Changjiang Scholars and Innovative Research Team in University (IRT1173).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, Y., Xu, Y. An efficient FPRAS type group testing procedure to approximate the number of defectives. J Comb Optim 27, 302–314 (2014). https://doi.org/10.1007/s10878-012-9516-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-012-9516-5

Keywords

Navigation