227 search results - page 7 / 46 » Approximation of the Quadratic Set Covering problem |
ICDT
2005
ACM
14 years 27 days 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...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
FOCS
2002
IEEE
14 years 10 days ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...