15 search results - page 1 / 3 » On the Minimum Hitting Set of Bundles Problem |
61
Voted
AAIM
2008
Springer
15 years 4 months ago
2008
Springer
CORR
2011
Springer
14 years 1 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...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
DCG
2010
14 years 9 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
78
Voted
COMBINATORICS
2007
14 years 9 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...