IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v41y2021i1d10.1007_s10878-020-00661-6.html
   My bibliography  Save this article

Quaternary splitting algorithm in group testing

Author

Listed:
  • Jinn Lu

    (National Chiao Tung University)

  • Hung-Lin Fu

    (National Chiao Tung University)

Abstract

In Classical group testing, one is given a population of n items N which contains some defective d items inside. A group test (pool) is a test on a subset of N. Under the circumstance of no errors, a test is negative if the testing pool contains no defective items and the test is positive if the testing pool contains at least one defective item but we don’t know which one. The goal is to find all defectives by using as less tests as possible, mainly to minimize the number of tests (in the worst case situation). Let M(d, n) denote the minimum number of tests in the worst case situation where $$|N|=n$$ | N | = n and d is the number of defectives. In this paper, we focus on estimating M(d, n) and obtain a better result than known ones in various cases of d and n.

Suggested Citation

  • Jinn Lu & Hung-Lin Fu, 2021. "Quaternary splitting algorithm in group testing," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 73-79, January.
    • Handle: RePEc:spr:jcomop:v:41:y:2021:i:1:d:10.1007_s10878-020-00661-6
    DOI: 10.1007/s10878-020-00661-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00661-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-020-00661-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:41:y:2021:i:1:d:10.1007_s10878-020-00661-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.