Problems and algorithms for covering arrays via set covers

DOI10.1016/J.TCS.2019.10.018MaRDI QIDQ2333828zbMATH OpenOpenAlexWikidataFDO

Authors Ludwig Kampel, Manuel Leithner, Bernhard Garn, Dimitris Simos

Publication date 13 November 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2019.10.018

zbMATH Keywords

covering arraysgreedy heuristic algorithmsset coversweighted budgeted covering arraysweighted budgeted set covers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial optimization (90C27)

Recommendations

• Covering arrays via set covers
• Problems and algorithms for covering arrays
• A survey on the problems and algorithms for covering arrays via set covers

Cites work

• A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
• A Greedy Heuristic for the Set-Covering Problem
• A survey of methods for constructing covering arrays
• A survey on the problems and algorithms for covering arrays via set covers
• A threshold of ln n for approximating set cover
• Classification algorithms for codes and designs
• Classification of orthogonal arrays by integer programming
• Constraint models for the covering test problem
• Covering arrays and intersecting codes
• Covering arrays via set covers
• Families of \(k\)-independent sets
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1323125 (Why is no real title available?)
• scientific article; zbMATH DE number 898426 (Why is no real title available?)
• Introduction to combinatorial testing
• New covering array numbers
• Orthogonal Arrays of Index Unity
• Problems and algorithms for covering arrays
• The budgeted maximum coverage problem
• The CRC handbook of combinatorial designs
• Variable strength covering arrays

Cited in

(13)

• Covering arrays via set covers
• An algorithm for set covering problem
• Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
• A greedy algorithm to construct covering arrays using a graph representation
• A survey on the problems and algorithms for covering arrays via set covers
• Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
• scientific article; zbMATH DE number 5177325 (Why is no real title available?)
• scientific article; zbMATH DE number 4106856 (Why is no real title available?)
• Two methods of ordering the covering elements for the solution of the set covering problem
• A primer on the application of neural networks to covering array generation
• Disjoint Covers in Replicated Heterogeneous Arrays
• Connected Set Cover Problem and Its Applications
• Dynamic programming based algorithms for set multicover and multiset multicover problems

Describes a project that uses

Uses Software

• AETG

This page was built for publication: Problems and algorithms for covering arrays via set covers

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