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 条
  • [21] Approximation algorithms for geometric conflict free covering problems
    Banik, Aritra
    Sahlot, Vibha
    Saurabh, Saket
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2020, 89
  • [22] Parameterized counting algorithms for general graph covering problems
    Nishimura, N
    Ragde, P
    Thilikos, DM
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2005, 3608 : 99 - 109
  • [23] Improved approximation algorithms for minimum power covering problems
    Calinescu, Gruia
    Kortsarz, Guy
    Nutov, Zeev
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 285 - 300
  • [24] Improved Approximation Algorithms for Minimum Power Covering Problems
    Calinescu, Gruia
    Kortsarz, Guy
    Nutov, Zeev
    APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2018), 2018, 11312 : 134 - 148
  • [25] Approximation algorithms for mixed fractional packing and covering problems
    Jansen, K
    EXPLORING NEW FRONTIERS OF THEORETICAL INFORMATICS, 2004, 155 : 223 - 236
  • [26] FAST APPROXIMATION ALGORITHMS FOR FRACTIONAL PACKING AND COVERING PROBLEMS
    PLOTKIN, SA
    SHMOYS, DB
    TARDOS, E
    MATHEMATICS OF OPERATIONS RESEARCH, 1995, 20 (02) : 257 - 301
  • [27] Approximation algorithms for mixed fractional packing and covering problems
    Jansen, K
    APPROXIMATION AND ONLINE ALGORITHMS, 2004, 3351 : 6 - 8
  • [28] Primal–Dual Algorithms for Precedence Constrained Covering Problems
    S. Thomas McCormick
    Britta Peis
    José Verschae
    Andreas Wierz
    Algorithmica, 2017, 78 : 771 - 787
  • [29] APPROXIMATION ALGORITHMS FOR THE SET COVERING AND VERTEX COVER PROBLEMS
    HOCHBAUM, DS
    SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 555 - 556
  • [30] Online Algorithms for Covering and Packing Problems with Convex Objectives
    Azar, Yossi
    Buchbinder, Niv
    Chan, T-H. Hubert
    Chen, Shahar
    Cohen, Ilan Reuven
    Gupta, Anupam
    Huang, Zhiyi
    Kang, Ning
    Nagarajan, Viswanath
    Naor, Joseph
    Panigrahi, Debmalya
    2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 148 - 157
12345