Sciweavers

CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 3 months ago
Algorithms for Implicit Hitting Set Problems
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...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
ESA
2009
Springer
115views Algorithms» more  ESA 2009»
14 years 6 months ago
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
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...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf