Problems and algorithms for covering arrays

被引：163
|
作者：
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 条
  • [41] Solving vertex covering problems using hybrid genetic algorithms
    Huo, HW
    Xu, XZ
    XuJin
    Bao, Z
    2000 5TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, VOLS I-III, 2000, : 1663 - 1666
  • [42] Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
    Kampel, Ludwig
    Hiess, Irene
    Kotsireas, Ilias S.
    Simos, Dimitris E.
    JOURNAL OF COMBINATORIAL DESIGNS, 2023, 31 (04) : 205 - 261
  • [43] Covering arrays, augmentation, and quilting arrays
    Colbourn, Charles J.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (03)
  • [44] Tower of covering arrays
    Torres-Jimenez, Jose
    Izquierdo-Marquez, Idelfonso
    Kacker, Raghu N.
    Kuhn, D. Richard
    DISCRETE APPLIED MATHEMATICS, 2015, 190 : 141 - 146
  • [45] Distributed and Parallel Algorithms for Weighted Vertex Cover and other Covering Problems
    Koufogiannakis, Christos
    Young, Neal E.
    PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 171 - 179
  • [46] Exact algorithms for budgeted prize-collecting covering subgraph problems
    Morandi, N.
    Leus, R.
    Yaman, H.
    COMPUTERS & OPERATIONS RESEARCH, 2022, 144
  • [47] Survey of Covering Arrays
    Torres-Jimenez, Jose
    Izquierdo-Marquez, Idelfonso
    2013 15TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2013), 2014, : 20 - 27
  • [48] Experimental analysis of approximation algorithms for the vertex cover and set covering problems
    Gomes, Fernando C.
    Meneses, Claudio N.
    Pardalos, Panos M.
    Viana, Gerardo Valdisio R.
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3520 - 3534
  • [49] New exact algorithms for planar maximum covering location by ellipses problems
    Tedeschi, Danilo
    Andretta, Marina
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 291 (01) : 114 - 127
  • [50] APPROXIMATION ALGORITHMS FOR INTEGER COVERING PROBLEMS VIA GREEDY COLUMN GENERATION
    CRAMA, Y
    VANDEKLUNDERT, J
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1994, 28 (03): : 283 - 302
12345