arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1705.02708cs.ITmath.ITmath.PR
收藏

几类成组测试算法的最优性

On the optimality of some group testing algorithms

Matthew Aldridge

摘要:

我们考虑了$θ\in (0,1)$的具有$k = Θ(n^θ)$缺陷的Bernoulli非自适应组检验。已知实用的明确缺陷(DD)检测算法对于$θ\geq 1/2$是最佳的。我们给出了一个新的上限率的DD,表明DD是严格次优的$θ< 0.41$。我们还表明,SCOMP算法和算法的基础上线性规划实现的速率至少高达DD,所以特别是也是最佳的$θ\geq 1/2$。

英文摘要:

We consider Bernoulli nonadaptive group testing with $k = Θ(n^θ)$ defectives, for $θ\in (0,1)$. The practical definite defectives (DD) detection algorithm is known to be optimal for $θ\geq 1/2$. We give a new upper bound on the rate of DD, showing that DD is strictly suboptimal for $θ< 0.41$. We also show that the SCOMP algorithm and algorithms based on linear programming achieve a rate at least as high as DD, so in particular are also optimal for $θ\geq 1/2$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑