Covering t-sets with (t+2)-sets

DOI10.1016/S0166-218X(99)00090-6MaRDI QIDQ1302176zbMATH OpenOpenAlexFDO

Authors Kari J. Nurmela, Patric R. J. Östergård

Publication date 26 April 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00090-6

zbMATH Keywords

combinatorial optimizationautomorphism grouptabu searchcovering design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Recommendations

• New coverings oft-sets with (t + 1)-sets
• scientific article; zbMATH DE number 5233136
• New upper bounds on the minimum size of covering designs
• New constructions for covering designs

Cited in

(11)

• Small covering designs by branch-and-cut
• Computational cost of the Fekete problem. I: The forces method on the 2-sphere
• Generalized covering designs and clique coverings
• Covering \(t\)-element sets by partitions
• On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)
• Upper bounds on the general covering numberC_λ(v,k,t,m)
• A multilevel cooperative tabu search algorithm for the covering design problem
• A tabu search algorithm for the covering design problem
• Variable neighborhood descent heuristic for covering design problem
• Some \(t\)-designs are minimal \((t+1)\)-coverings
• New constructions for covering designs

This page was built for publication: Covering \(t\)-sets with \((t+2)\)-sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302176)