一种改进的之字形竞赛小组测试方法

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization Pub Date : 2022-02-01 DOI:10.1016/j.disopt.2022.100687

Jun Wu , Yongxi Cheng , Ding-Zhu Du

{"title":"一种改进的之字形竞赛小组测试方法","authors":"Jun Wu , Yongxi Cheng , Ding-Zhu Du","doi":"10.1016/j.disopt.2022.100687","DOIUrl":null,"url":null,"abstract":"<div>In many fault detection problems, we want to identify defective items from a set of <math><mi>n</mi></math> items 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. In practice, the number <math><mi>d</mi></math> of defective items is often unknown in advance. In this paper, we improve the previously best algorithm for a central problem in combinatorial group testing with unknown number of defectives (Cheng et al., 2014), and prove that the number of tests used by our new algorithm is no more than <math><mrow><mi>d</mi><mo>log</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mi>d</mi></mrow></mfrac><mo>+</mo><mrow><mo>(</mo><mn>5</mn><mo>−</mo><mo>log</mo><mn>5</mn><mo>)</mo></mrow><mi>d</mi><mo>+</mo><mi>O</mi><mrow><mo>(</mo><msup><mrow><mo>log</mo></mrow><mrow><mn>2</mn></mrow></msup><mi>d</mi><mo>)</mo></mrow></mrow></math>, where <math><mo>log</mo></math> is of base 2.</div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An improved zig zag approach for competitive group testing\",\"authors\":\"Jun Wu , Yongxi Cheng , Ding-Zhu Du\",\"doi\":\"10.1016/j.disopt.2022.100687\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>In many fault detection problems, we want to identify defective items from a set of <math><mi>n</mi></math> items 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. In practice, the number <math><mi>d</mi></math> of defective items is often unknown in advance. In this paper, we improve the previously best algorithm for a central problem in combinatorial group testing with unknown number of defectives (Cheng et al., 2014), and prove that the number of tests used by our new algorithm is no more than <math><mrow><mi>d</mi><mo>log</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mi>d</mi></mrow></mfrac><mo>+</mo><mrow><mo>(</mo><mn>5</mn><mo>−</mo><mo>log</mo><mn>5</mn><mo>)</mo></mrow><mi>d</mi><mo>+</mo><mi>O</mi><mrow><mo>(</mo><msup><mrow><mo>log</mo></mrow><mrow><mn>2</mn></mrow></msup><mi>d</mi><mo>)</mo></mrow></mrow></math>, where <math><mo>log</mo></math> is of base 2.</div>\",\"PeriodicalId\":50571,\"journal\":{\"name\":\"Discrete Optimization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2022-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1572528622000020\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Optimization","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1572528622000020","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 2

摘要

在许多故障检测问题中，我们希望使用最少的测试次数从一组n个项目中识别出有缺陷的项目。组测试适用于这样的场景:每个测试都针对项目的一个子集，并告诉该子集是否至少包含一个有缺陷的项目。在实践中，不良品的数量往往是事先未知的。。在本文中，我们改进了先前针对缺陷数未知的组合群测试中心问题的最佳算法(Cheng et al.， 2014)，并证明了我们的新算法使用的测试次数不超过dlogd +(5−log5)d+O(log2d)，其中log以2为底。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An improved zig zag approach for competitive group testing

In many fault detection problems, we want to identify defective items from a set of $n$ items 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. In practice, the number $d$ of defective items is often unknown in advance. In this paper, we improve the previously best algorithm for a central problem in combinatorial group testing with unknown number of defectives (Cheng et al., 2014), and prove that the number of tests used by our new algorithm is no more than $d log \frac{n}{d} + (5 - log 5) d + O ({log}^{2} d)$ , where $log$ is of base 2.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Optimization 管理科学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.