Covering arrays via set covers (Q1742691)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Covering arrays via set covers	scientific article

Statements

scholarly article

0 references

Covering arrays via set covers (English)

0 references

0 references

0 references

Dimitris E. Simos

0 references

publication date

12 April 2018

0 references

zbMATH Keywords

covering array

0 references

set cover

0 references

algorithm

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.endm.2018.02.014

0 references

Set Partitioning: A survey

0 references

Classification of orthogonal arrays by integer programming

0 references

A Greedy Heuristic for the Set-Covering Problem

0 references

Problems and algorithms for covering arrays

0 references

A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem

0 references

Classification algorithms for codes and designs

0 references

Covering arrays and intersecting codes

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.ENDM.2018.02.014

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1742691

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1742691&oldid=38724215"