IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v369y2020ics0096300319308185.html
   My bibliography  Save this article

Improved covering arrays using covering perfect hash families with groups of restricted entries

Author

Listed:
  • Torres-Jimenez, Jose
  • Izquierdo-Marquez, Idelfonso

Abstract

Covering perfect hash families (CPHFs) are used to represent compactly some covering arrays. For CPHFs there is an efficient way to determine if the covering arrays derived from them are or not complete covering arrays; and this characteristic eases the construction of large covering arrays by greedy and metaheuristic methods working over the CPHF representation. CPHFs has been constructed in other works by backtracking, tabu search, simulated annealing, and greedy methods. The present work introduces a new simulated annealing algorithm that is able to construct CPHFs with groups of rows with restricted entries. In a CPHF of this kind the entries have some dependencies among them, that is, the values in some rows restrict the values that can appear in other rows. Restricted CPHFs produce covering arrays smaller than the ones derived from CPHFs without restricted entries. By using the new simulated annealing algorithm, we construct 135 new CPHFs whose derived covering arrays improve the upper bound of 19,669 covering array numbers.

Suggested Citation

  • Torres-Jimenez, Jose & Izquierdo-Marquez, Idelfonso, 2020. "Improved covering arrays using covering perfect hash families with groups of restricted entries," Applied Mathematics and Computation, Elsevier, vol. 369(C).
    • Handle: RePEc:eee:apmaco:v:369:y:2020:i:c:s0096300319308185
    DOI: 10.1016/j.amc.2019.124826
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319308185
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124826?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.

    References listed on IDEAS

    as
    1. Hugo Ordoñez & Jose Torres-Jimenez & Carlos Cobos & Armando Ordoñez & Enrique Herrera-Viedma & Gildardo Maldonado-Martinez, 2019. "A business process clustering algorithm using incremental covering arrays to explore search space and balanced Bayesian information criterion to evaluate quality of solutions," PLOS ONE, Public Library of Science, vol. 14(6), pages 1-27, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wagner, Michael & Colbourn, Charles J. & Simos, Dimitris E., 2022. "In-Parameter-Order strategies for covering perfect hash families," Applied Mathematics and Computation, Elsevier, vol. 421(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:eee:apmaco:v:369:y:2020:i:c:s0096300319308185. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

      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.