154 search results - page 1 / 31 » Algorithms for Implicit Hitting Set Problems |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
AAIM
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
ESA
2009
Springer
13 years 11 months ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...