Two‐stage algorithms for covering array construction

DOI10.1002/jcd.21657zbMath1429.05026arXiv1606.06730OpenAlexW2963294326WikidataQ128039712 ScholiaQ128039712MaRDI QIDQ5205494

Kaushik Sarkar, Charles J. Colbourn

Publication date: 12 December 2019

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.06730

zbMATH Keywords

conditional expectationrandomized algorithmLovász local lemmacovering arraytwo-stage algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Orthogonal arrays, Latin squares, Room squares (05B15) Randomized algorithms (68W20) Combinatorial aspects of packing and covering (05B40)

Related Items

Combinatorial testing: using blocking to assign test cases for validating complex software systems ⋮ Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma ⋮ Upper Bounds on the Size of Covering Arrays