Problems and algorithms for covering arrays

被引：162
|
作者：
Hartman, A [1 ]
Raskin, L [1 ]
机构：
[1] IBM Haifa Res Labs, IL-31905 Haifa, Israel
来源：
DISCRETE MATHEMATICS | 2004年 / 284卷 / 1-3期
关键词：
covering array; orthogonal array;
D O I：
10.1016/j.disc.2003.11.029
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：149 / 156
页数：8
相关论文
共 50 条
  • [1] Problems and algorithms for covering arrays via set covers
    Kampel, Ludwig
    Leithner, Manuel
    Garn, Bernhard
    Simos, Dimitris E.
    THEORETICAL COMPUTER SCIENCE, 2019, 800 : 90 - 106
  • [2] Conditional expectation algorithms for covering arrays
    Colbourn, Charles J.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2014, 90 : 97 - 115
  • [3] Partial Covering Arrays: Algorithms and Asymptotics
    Sarkar, Kaushik
    Colbourn, Charles J.
    De Bonis, Annalisa
    Vaccaro, Ugo
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (06) : 1470 - 1489
  • [4] Partial Covering Arrays: Algorithms and Asymptotics
    Kaushik Sarkar
    Charles J. Colbourn
    Annalisa De Bonis
    Ugo Vaccaro
    Theory of Computing Systems, 2018, 62 : 1470 - 1489
  • [5] Partial Covering Arrays: Algorithms and Asymptotics
    Sarkar, Kaushik
    Colbourn, Charles J.
    de Bonis, Annalisa
    Vaccaro, Ugo
    Combinatorial Algorithms, 2016, 9843 : 437 - 448
  • [6] GRAPH ALGORITHMS AND COVERING PROBLEMS
    PERL, J
    COMPUTING, 1974, 13 (02) : 107 - 113
  • [7] Rounding algorithms for covering problems
    Bertsimas, D
    Vohra, R
    MATHEMATICAL PROGRAMMING, 1998, 80 (01) : 63 - 89
  • [8] Algorithms for rectangular covering problems
    Porschen, S
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1, 2006, 3980 : 40 - 49
  • [9] Rounding algorithms for covering problems
    Dimitris Bertsimas
    Rakesh Vohra
    Mathematical Programming, 1998, 80 : 63 - 89
  • [10] Algorithms to locate errors using covering arrays
    Martinez, Conrado
    Moura, Lucia
    Panario, Daniel
    Stevens, Brett
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 504 - +
12345