Name
Title | ||
|---|---|---|
An efficient FPRAS type group testing procedure to approximate the number of defectives |
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s10878-012-9516-5 | J. Comb. Optim. |
Keywords | Field | DocType |
Fault detection,Group testing,Randomized algorithm,FPRAS | Randomized algorithm,Combinatorics,Fault detection and isolation,Algorithm,Group testing,Mathematics | Journal |
Volume | Issue | ISSN |
27 | 2 | 1382-6905 |
Citations | PageRank | References |
4 | 0.42 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongxi Cheng | 1 | 125 | 15.23 |
| Yinfeng Xu | 2 | 1636 | 108.18 |