The minimum likely column cover problem

doi:10.1016/j.ipl.2003.11.003

Information Processing Letters

Volume 89, Issue 4, 28 February 2004, Pages 175-179

https://doi.org/10.1016/j.ipl.2003.11.003 Get rights and content

Abstract

In this paper we introduce and study the problem of computing optimal lottery schemes in the case in which a weight function is specified over the domain set. In particular, we prove that if the number of required hits is equal to 1, then the problem is solvable in polynomial time, and that if the number of required hits is equal to t, then the problem admits a polynomial-time $k t$ -approximation algorithm, where k denotes the size of the tuples to be hit.

References (10)

V. Rödl
On a packing and covering problem
European J. Combin.
(1985)
G. Ausiello et al.
Complexity and Approximation
(1999)
J.A. Bate et al.
Some algorithmic results on (2,3,3,v) designs and (2,4,4,v) designs
Util. Math.
(1981)
P. Crescenzi, F. Montecalvo, G. Rossi, Optimal covering designs: complexity results and new bounds, Discrete Appl....

There are more references available in the full text version of this article.

Cited by (0)

View full text

The minimum likely column cover problem

Abstract

European J. Combin.

Complexity and Approximation

Some algorithmic results on (2,3,3,v) designs and (2,4,4,v) designs

Util. Math.