The minimum likely column cover problem

DOI10.1016/j.ipl.2003.11.003zbMath1176.68088OpenAlexW2040233419MaRDI QIDQ1029075

Federico Greco, Pierluigi Crescenzi

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.11.003

zbMATH Keywords

computational complexitycombinatorial problemsapproximation algorithmscovering designlottery schema

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a packing and covering problem
• On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)
• Optimal covering designs: complexity results and new bounds
• On coverings
• New constructions for covering designs

This page was built for publication: The minimum likely column cover problem