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

Authors:
Yongxi Cheng;Yinfeng Xu
Affiliations:
School of Management, Xi'an Jiaotong University, Xi'an, China 710049;School of Management, Xi'an Jiaotong University, Xi'an, China 710049 and State Key Lab for Manufacturing Systems Engineering, Xi'an, China 710049 and Ministry of Education Key Lab for Process Cont ...
Venue:
Journal of Combinatorial Optimization
Year:
2014

Citing 4
Cited 0

The space complexity of approximating the frequency moments

Journal of Computer and System Sciences
What's hot and what's not: tracking most frequent items dynamically

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Bounds for nonadaptive group tests to estimate the amount of defectives

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Born again group testing: Multiaccess communications

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.