455 search results - page 22 / 91 » Approximation Algorithms for Partial Covering Problems |
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
106
click to vote
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
ICDT
2005
ACM
15 years 3 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...
ESA
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...