We give a general framework for the problem of finding all minimal hitting sets of a family of objects in by another. We apply this framework to the following problems: (i) hitting hyper-rectangles by points in ; (ii) stabbing connected objects by axis-parallel hyperplanes in ; and (iii) hitting half-planes by points. For both the covering and hitting set versions, we obtain incremental polynomial-time algorithms, provided that the dimension d is fixed. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Elbassioni, K., Makino, K., & Rauf, I. (2009). Output-sensitive algorithms for enumerating minimal transversals for some geometric hypergraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5757 LNCS, pp. 143–154). https://doi.org/10.1007/978-3-642-04128-0_13
Mendeley helps you to discover research relevant for your work.