The minimum likely column cover problem

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 n...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 89; no. 4; pp. 175 - 179
Main Authors CRESCENZI, Pilu, GRECO, Federico
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier Science 28.02.2004
Elsevier Sequoia S.A
Subjects
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Designs and configurations
Exact sciences and technology
Lotteries
Mathematics
Ratios
Sciences and techniques of general use
Studies
Theoretical computing
Computer theory
Lottery
Combinatorial problem
Covering problem
Information processing
Approximation algorithm
Computational complexity
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2003.11.003