New constructions for covering designs

DOI10.1002/jcd.3180030404zbMath0885.05053arXivmath/9502238OpenAlexW2008697975MaRDI QIDQ4373370

Oren Patashnik, Greg Kuperberg, Daniel M. Gordon

Publication date: 15 April 1998

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

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

zbMATH Keywords

greedy algorithmcovering design

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40)

Related Items

Upper bounds on the general covering numberC_λ(v,k,t,m) ⋮ What we know and what we do not know about Turán numbers ⋮ Uncoverings-by-bases for base-transitive permutation groups. ⋮ Constraint Orbital Branching ⋮ Renaming and the weakest family of failure detectors ⋮ A tabu search algorithm for the covering design problem ⋮ An effective greedy heuristic for the social golfer problem ⋮ Optimal covering designs: complexity results and new bounds ⋮ Asymptotic Bounds for General Covering Designs ⋮ Connected Covering Numbers ⋮ New coverings oft-sets with (t + 1)-sets ⋮ The minimum likely column cover problem ⋮ Generalized covering designs and clique coverings ⋮ Variable neighborhood descent heuristic for covering design problem ⋮ General upper bounds on the minimum size of covering designs ⋮ Error-correcting codes from permutation groups ⋮ Optimal partial clique edge covering guided by potential energy minimization ⋮ Connected coverings and an application to oriented matroids ⋮ Some \(t\)-designs are minimal \((t+1)\)-coverings ⋮ Comparative analysis of topological constructions of sparse flat neighborhood networks for cluster supercomputers ⋮ Towards a Theory of Intrusion Detection

Cites Work

• Unnamed Item
• Unnamed Item
• On a packing and covering problem
• On coverings