The minimum likely column cover problem
type: Item
instance of: scholarly article
title: The minimum likely column cover problem
zbMATH Open document ID: 1176.68088
author: Federico Greco
author: Pilu Crescenzi
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 5576938
zbMATH Keywords: approximation algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: computational complexity
zbMATH Keywords: covering design
zbMATH Keywords: lottery schema
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.11.003
OpenAlex ID: W2040233419
cites work: Q4258216
cites work: Q3936754
cites work: Q4873725
cites work: Optimal covering designs: complexity results and new bounds
cites work: On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)
cites work: New constructions for covering designs
cites work: Q4026151
cites work: Q4304396
cites work: On a packing and covering problem
cites work: On coverings
DOI: 10.1016/J.IPL.2003.11.003
Recommended article: The Probabilistic Minimum Vertex-covering Problem
Recommended article: Q3021055
Recommended article: The minimum cut cover problem
Recommended article: Automata, Languages and Programming
Recommended article: The minimum-entropy set cover problem
Recommended article: Minimal covering problem and PLA minimization
Recommended article: Min-Power Covering Problems
Recommended article: A column generation approach for the maximal covering location problem
Recommended article: Q4007808
Recommended article: Q5319056
description: scientific article; zbMATH DE number 5576938