Optimal covering designs: complexity results and new bounds

DOI10.1016/j.dam.2003.11.006zbMath1063.05031OpenAlexW2044660400MaRDI QIDQ1765237

Federico Montecalvo, Gianluca Rossi, Pierluigi Crescenzi

Publication date: 23 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.dam.2003.11.006

zbMATH Keywords

optimal lottery scheme

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of packing and covering (05B40)

Related Items (3)

A tabu search algorithm for the covering design problem ⋮ Asymptotic Bounds for General Covering Designs ⋮ The minimum likely column cover problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On large sets of disjoint Steiner triple systems. VI
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)
• Approximation algorithms for combinatorial problems
• New constructions for covering designs
• Large sets of coverings

This page was built for publication: Optimal covering designs: complexity results and new bounds