In-parameter-order strategies for covering perfect hash families

DOI10.1016/J.AMC.2022.126952MaRDI QIDQ2079142zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 March 2022

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2022.126952

zbMATH Keywords

algorithmscovering arraycovering perfect hash familiesin-parameter-orderpermutation vector

Mathematics Subject Classification ID

Designs and configurations (05Bxx) Discrete mathematics in relation to computer science (68Rxx) Mathematical programming (90Cxx)

Recommendations

• Improved covering arrays using covering perfect hash families with groups of restricted entries
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Covering arrays of higher strength from permutation vectors
• An efficient design and implementation of the in-parameter-order algorithm
• Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation

Cites work

• A greedy-metaheuristic 3-stage approach to construct covering arrays
• A survey on the problems and algorithms for covering arrays via set covers
• Algebraic modelling of covering arrays
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Constructing strength three covering arrays with augmented annealing
• Covering and radius-covering arrays: constructions and classification
• Covering arrays from cyclotomy
• Covering arrays of higher strength from permutation vectors
• Covering arrays of strength three from extended permutation vectors
• Improved covering arrays using covering perfect hash families with groups of restricted entries
• Roux-type constructions for covering arrays of strengths three and four
• Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
• Subspace restrictions and affine composition for covering perfect hash families
• Tabu search for covering arrays using permutation vectors

Cited in

(7)

• Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation
• Phorma: perfectly hashable order restricted multidimensional arrays
• An efficient design and implementation of the in-parameter-order algorithm
• Algorithmic methods for covering arrays of higher index
• Improved covering arrays using covering perfect hash families with groups of restricted entries
• IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation
• New families of strength-3 covering arrays using linear feedback shift register sequences

Describes a project that uses

Uses Software

• CAgen

This page was built for publication: In-parameter-order strategies for covering perfect hash families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079142)