Problems and algorithms for covering arrays

Alan Hartman, Leonid Raskin

Research output: Contribution to journalArticlepeer-review


Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.

Original languageEnglish
Pages (from-to)149-156
Number of pages8
JournalDiscrete Mathematics
Issue number1-3
StatePublished - 6 Jul 2004
Externally publishedYes


  • Covering array
  • Orthogonal array

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Problems and algorithms for covering arrays'. Together they form a unique fingerprint.

Cite this