666 search results - page 1 / 134 » The Pipelined Set Cover Problem |
ICDT
2005
ACM
13 years 10 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
COR
2006
13 years 4 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
IPL
2008
13 years 4 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
SIAMCOMP
1998
13 years 4 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...