Covering arrays via set covers

DOI10.1016/j.endm.2018.02.014zbMath1397.90328OpenAlexW2790735614MaRDI QIDQ1742691

Ludwig Kampel, Bernhard Garn, Dimitris E. Simos

Publication date: 12 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.02.014

zbMATH Keywords

algorithmset covercovering array

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

A primer on the application of neural networks to covering array generation ⋮ Algebraic techniques for covering arrays and related structures ⋮ Problems and algorithms for covering arrays via set covers

Uses Software

• AETG

Cites Work

• Classification algorithms for codes and designs
• Problems and algorithms for covering arrays
• Classification of orthogonal arrays by integer programming
• A Greedy Heuristic for the Set-Covering Problem
• Set Partitioning: A survey
• Covering arrays and intersecting codes
• A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem

This page was built for publication: Covering arrays via set covers